Submission #1282030

#TimeUsernameProblemLanguageResultExecution timeMemory
1282030nataliaaFestival (IOI25_festival)C++20
0 / 100
34 ms7136 KiB
#include "festival.h" #include<bits/stdc++.h> using namespace std; std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { pair<int,int> p; int n = P.size(); sort(P.begin(), P.end()); vector<int> v; int s = 0; for(int i = 0; i < n ; i++) { if(P[i]<=A) { A-=P[i]; v.push_back(i); s++; } else break; } return v; }
#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...