제출 #1325965

#제출 시각아이디문제언어결과실행 시간메모리
1325965somefolk축제 (IOI25_festival)C++20
5 / 100
35 ms5808 KiB
#include <bits/stdc++.h> using namespace std; struct El { int p, t, idx; }; vector<int> max_coupons(int a, vector<int> p, vector<int> t){ int n = (int)p.size(); vector<El> el(n); for(int i = 0; i < n; i++) el[i] = {p[i], t[i], i}; sort(el.begin(), el.end(), [&](auto l, auto r){ return l.p < r.p; }); vector<int> sol; for(auto &i : el){ if(a - i.p < 0) break; a -= i.p; sol.push_back(i.idx); } return sol; }
#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...