제출 #1269304

#제출 시각아이디문제언어결과실행 시간메모리
1269304sula2Festival (IOI25_festival)C++20
0 / 100
23 ms4168 KiB
#include <bits/stdc++.h> using namespace std; vector<int> max_coupons(int a, vector<int> p, vector<int> t) { int n = p.size(); vector<int> ind(n); iota(ind.begin(), ind.end(), 0); sort(ind.begin(), ind.end()); long long sum = accumulate(p.begin(), p.end(), 0LL); while (!ind.empty() && sum > a) { sum -= p[ind.back()]; ind.pop_back(); } return ind; }
#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...