Submission #1253406

#TimeUsernameProblemLanguageResultExecution timeMemory
1253406nickolasarapidisFestival (IOI25_festival)C++20
5 / 100
40 ms4932 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; #define F first #define S second vector<int> max_coupons(int A, vector<int> P, vector<int> T){ vector<int> R; int N = P.size(); vector<pair<int, int>> pr(N); for(int i = 0; i < N; i++){ pr[i] = {P[i], i}; } sort(pr.begin(), pr.end()); for(int i = 0; i < N; i++){ if(A - pr[i].F > 0){ A -= pr[i].F; R.push_back(pr[i].S); } else 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...