aboutsummaryrefslogtreecommitdiff
path: root/earliest_possible_full_bloom.cpp
blob: f990e620efec7ce5e0e3d315ae02501784612a9b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include "leetcode.h"

class Solution {
public:
  int earliestFullBloom(vector<int> &plantTime, vector<int> &growTime) {
    int n = plantTime.size();
    vector<pair<int, int>> times(n);
    for (int i = 0; i < n; i++) {
      times[i].first = -growTime[i];
      times[i].second = plantTime[i];
    }
    sort(times.begin(), times.end());
    int total = 0, curr = 0;
    for (int i = 0; i < n; i++) {
      total = max(total, curr + times[i].second - times[i].first);
      curr += times[i].second;
    }
    return total;
  }
};

int main() {
  Solution obj;
  vector<int> plantTime = {1, 4, 3}, growTime = {2, 3, 1};
  cout << obj.earliestFullBloom(plantTime, growTime);
}