제출 #1326188

#제출 시각아이디문제언어결과실행 시간메모리
1326188hehe축제 (IOI25_festival)C++20
0 / 100
33 ms3504 KiB
#include <bits/stdc++.h> using namespace std; #define int long long vector<signed> max_coupons(signed a, vector<signed> price, vector<signed> type){ int n = price.size(); sort(price.begin(), price.end()); int i = 0; vector<signed> ans; while(i < n && a >= price[i]){ a-= price[i]; ans.push_back(price[i]); i++; } 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...