제출 #1257034

#제출 시각아이디문제언어결과실행 시간메모리
1257034ogkostya축제 (IOI25_festival)C++20
5 / 100
39 ms4936 KiB
#include "festival.h" #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>> x = std::vector<std::pair<int, int>>(n); for (int i = 0; i < n; i++) x[i] = std::make_pair(P[i], i); std::sort(x.begin(), x.end()); std::vector<int> ans = {}; for (int i = 0; i < n; i++) { if (A >= x[i].first) { ans.push_back(x[i].second); A -= x[i].first; } else break; } return ans; }
#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...