제출 #1258107

#제출 시각아이디문제언어결과실행 시간메모리
1258107mkkkkkkkkFestival (IOI25_festival)C++20
5 / 100
42 ms5564 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,vec2; for(int i=0;i<P.size();i++) { if(T[i]==2) { vec.push_back({P[i],i}); } else vec2.push_back({P[i],i}); } sort(vec.begin(),vec.end()); sort(vec2.begin(),vec2.end()); vector<int> res; for(int i=0;i<vec2.size();i++) { if(A>=vec2[i].first) { A-=vec2[i].first; res.push_back(vec2[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...