| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1282057 | rira | 축제 (IOI25_festival) | C++20 | 0 ms | 0 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) {
	
	vector<int> ans,g=P;
	int l=A;
	int n=g.size();
	pair<int,int> k[n];
	for(int i=0;i<n;i++){
		k[i]={g[i],i};
	}
	sort(k,k+n);
	int i=0;
	while(k[i].first<=l&&i<n){
		l-=k[i].first;
		ans.push_back(k[i].second);
		i++;
	}
	return ans;
}
}
