제출 #1315917

#제출 시각아이디문제언어결과실행 시간메모리
1315917ezzzay축제 (IOI25_festival)C++20
5 / 100
39 ms5668 KiB
#include "festival.h" #include<bits/stdc++.h> using namespace std; #define pb push_back #define ff first #define ss second std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { vector<pair<int,int>>vc; vector<int>v; int N=P.size(); for(int i=0;i<N;i++){ vc.pb({P[i],i}); } sort(vc.begin(),vc.end()); for(auto p:vc){ if(p.ff<=A){ A-=p.ff; v.pb(p.ss); } } return v; }
#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...