제출 #1345888

#제출 시각아이디문제언어결과실행 시간메모리
1345888Jer축제 (IOI25_festival)C++20
5 / 100
28 ms5052 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();
	vector<pair<int, int>> d(n);

	for (int i = 0; i < n; i++)
		d[i] = {p[i], i};
	sort(d.begin(), d.end());

	vector<int> res;
	for (int i = 0; i < n and a >= d[i].first; a -= d[i].first, res.push_back(d[i].second), i++)
	{
	}

	return res;
}
#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...