Submission #1322224

#TimeUsernameProblemLanguageResultExecution timeMemory
1322224Trisanu_DasFestival (IOI25_festival)C++20
5 / 100
38 ms5040 KiB
#include "festival.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> max_coupons(int A, vector<int> P, vector<int> T){
    int n = P.size();
    vector<pair<int, int> > pp(n);
    vector<int> R;
    for(int i = 0; i < n; i++) pp[i] = {P[i], i};
    sort(pp.begin(), pp.end());
    for(int i = 0; i < n; i++){
        if(A > pp[i].first){
            R.push_back(pp[i].second);
            A -= pp[i].first;
        }
        if(A <= 0) break;
    }
    return R;
}
#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...