# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1251473 | vietbachleonkroos2326 | Festival (IOI25_festival) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> res;
void solvesub1(int &A,vector<int> &P, vector<int> &T){
vector<pair<int,int>> vec;
for(int i=0;i<n;i++){
vec.push_back({P[i],i});
}
sort(vec.begin(),vec.end());
int i=0;
while(A>=vec[i].first){
A-=vec[i].first;
res.push_back(vec[i].second);
i++;
}
}
void solvesub2(int &A,vector<int> &P, vector<int> &T){
}
void solvesub3(int &A,vector<int> &P, vector<int> &T){
}
vector<int> max_coupons(int A, vector<int> P, vector<int> T){
n=T.size();
bool checksub1=true;
bool checksub2=true;
for(i=0;i<n;i++){
if(T[i]!=1) checksub1=false;
if(T[i]>2) checksub2=false;
}
if(checksub1) solvesub1();
else if(checksub2) solvesub2();
else solvesub3();
return res;
}