Submission #1282076

#TimeUsernameProblemLanguageResultExecution timeMemory
1282076lukasuliashviliFestival (IOI25_festival)C++20
5 / 100
39 ms7140 KiB
#include <vector> #include <algorithm> std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { int N = P.size(); std::vector<std::pair<int, int>> items; for (int i = 0; i < N; ++i) { items.emplace_back(P[i], i); } std::sort(items.begin(), items.end()); std::vector<int> result; for (auto [price, index] : items) { if (A >= price) { A -= price; result.push_back(index); } else { break; } } return result; }
#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...