Intuition

To minimize the day when all flowers bloom, plant seeds with the longest grow time first. This way, their lengthy growth can overlap with the planting of other seeds, reducing the total time.

Approach

Pair each seed's plantTime and growTime.
Sort seeds in descending order of growTime.
Initialize curr (current day) and ans (latest bloom day) to 0.
For each seed in sorted order:

Add its plantTime to curr (accumulate planting days).
Calculate bloom day as curr + growTime.
Update ans to the maximum bloom day seen so far.

Return ans.

Code

[{"language":"C++","code":"class Solution {\npublic:\n   int earliestFullBloom(vector<int>& plantTime, vector<int>& growTime) {\n      int n = plantTime.size();\n      vector<pair<int, int>> seeds(n);\n      for (int i = 0; i < n; ++i)\n        seeds[i] = {growTime[i], plantTime[i]};\n      sort(seeds.rbegin(), seeds.rend());\n      int curr = 0, ans = 0;\n      for (auto& [g, p] : seeds) {\n        curr += p;\n        ans = max(ans, curr + g);\n      }\n      return ans;\n   }\n};","lang":"cpp","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#

Related Tags