1#include <stdio.h>
2#include <stdlib.h>
3
4struct Seed {
5    int plantTime;
6    int growTime;
7};
8
9int compare(const void *a, const void *b) {
10    struct Seed *seedA = (struct Seed *)a;
11    struct Seed *seedB = (struct Seed *)b;
12    return seedA->plantTime - seedB->plantTime;
13}
14
15int earliestFullBloom(int* plantTime, int plantTimeSize, int* growTime, int growTimeSize) {
16    struct Seed seeds[plantTimeSize];
17    for (int i = 0; i < plantTimeSize; i++) {
18        seeds[i].plantTime = plantTime[i];
19        seeds[i].growTime = growTime[i];
20    }
21    
22    qsort(seeds, plantTimeSize, sizeof(struct Seed), compare);
23    
24    int currentDay = 0;
25    int lastBloomDay = 0;
26    for (int i = 0; i < plantTimeSize; i++) {
27        currentDay += seeds[i].plantTime;
28        int bloomDay = currentDay + seeds[i].growTime;
29        if (bloomDay > lastBloomDay) {
30            lastBloomDay = bloomDay;
31        }
32    }
33    return lastBloomDay;
34}
35
36int main() {
37    int plantTime[] = {1, 4, 3};
38    int growTime[] = {2, 3, 1};
39    int result = earliestFullBloom(plantTime, 3, growTime, 3);
40    printf("Earliest Full Bloom Day: %d\n", result);
41    return 0;
42}
43

1#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Seed {
    int plantTime;
    int growTime;
};

bool compare(const Seed& a, const Seed& b) {
    return a.growTime > b.growTime;
}

int earliestFullBloom(vector<int>& plantTime, vector<int>& growTime) {
    int n = plantTime.size();
    vector<Seed> seeds(n);
    for (int i = 0; i < n; ++i) {
        seeds[i] = {plantTime[i], growTime[i]};
    }
    sort(seeds.begin(), seeds.end(), compare);

    int totalPlantDays = 0;
    int maxBloomDay = 0;

    for (const auto& seed : seeds) {
        totalPlantDays += seed.plantTime;
        maxBloomDay = max(maxBloomDay, totalPlantDays + seed.growTime);
    }
    
    return maxBloomDay;
}

int main() {
    vector<int> plantTime = {1, 4, 3};
    vector<int> growTime = {2, 3, 1};
    cout << "Earliest Full Bloom Day: " << earliestFullBloom(plantTime, growTime) << endl;
    return 0;
}