# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1258103 | mkkkkkkkk | Festival (IOI25_festival) | C++20 | 0 ms | 0 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());
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;
}