Submission #1282036

#TimeUsernameProblemLanguageResultExecution timeMemory
1282036nataliaaFestival (IOI25_festival)C++20
5 / 100
37 ms7132 KiB
#include "festival.h" #include<bits/stdc++.h> using namespace std; std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) { int n = P.size(); pair<int,int> p[n]; for(int i = 0; i <n; i++) { p[i].first = P[i]; p[i].second = i; } sort(p, p+n); vector<int> v; int s = 0; for(int i = 0; i < n ; i++) { if(p[i].first<=A) { A-=p[i].first; v.push_back(p[i].second); s++; } else break; } 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...