제출 #1282060

#제출 시각아이디문제언어결과실행 시간메모리
1282060georgeckitoFestival (IOI25_festival)C++20
5 / 100
259 ms25468 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) { vector<int> R; map< int, vector<int> > m; for(int i = 0; i < P.size(); i++) { m[P[i]].push_back(i); } sort(P.begin(), P.end()); for(int i = 0; i < P.size(); i++) { if(A-P[i] >= 0) { A -= P[i]; R.push_back(m[P[i]].back()); m[P[i]].pop_back(); } else break; } return R; } /* 4 13 4 1 500 3 8 3 14 4 */
#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...