earliest-possible-day-of-full-bloom.cpp

// Time:  O(nlogn)
// Space: O(n)

class Solution {
public:
    int earliestFullBloom(vector<int>& plantTime, vector<int>& growTime) {
        vector<int> order(size(plantTime));
        iota(begin(order), end(order), 0);
        sort(begin(order), end(order),
             [&growTime](const auto& a, const auto& b) {
                 return growTime[a] > growTime[b]; 
             });
        int result = 0, curr = 0;
        for (const auto& i : order) {
            curr += plantTime[i];
            result = max(result, curr + growTime[i]);
        }
        return result;
    }
};