Submission #1269305

#TimeUsernameProblemLanguageResultExecution timeMemory
1269305sula2Festival (IOI25_festival)C++20
5 / 100
37 ms4164 KiB
#include <bits/stdc++.h>
using namespace std;

vector<int> max_coupons(int a, vector<int> p, vector<int> t) {
    int n = p.size();
    vector<int> ind(n);
    iota(ind.begin(), ind.end(), 0);
    sort(ind.begin(), ind.end(), [&](int i, int j) { return p[i] < p[j]; });
    long long sum = accumulate(p.begin(), p.end(), 0LL);
    while (!ind.empty() && sum > a) {
        sum -= p[ind.back()];
        ind.pop_back();
    }
    return ind;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...