제출 #1258093

#제출 시각아이디문제언어결과실행 시간메모리
1258093mkkkkkkkk축제 (IOI25_festival)C++20
0 / 100
24 ms3396 KiB
#include "festival.h" #include <bits/stdc++.h> using namespace std; vector<int> max_coupons(int A, vector<int> P, vector<int> T) { vector<pair<int,int>> vec; for(int i=0;i<P.size();i++) { if(T[i]==2) { vec.push_back({P[i],i}); } } sort(vec.begin(),vec.end()); vector<int> res; for(int i=0;i<vec.size();i++) { if(vec[i].first<=A/2) { A=(A-vec[i].first)*2; res.push_back(vec[i].second); } } return res; }
#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...