제출 #1281491

#제출 시각아이디문제언어결과실행 시간메모리
1281491lizi14축제 (IOI25_festival)C++20
5 / 100
38 ms7128 KiB
#include "festival.h"
#include <bits/stdc++.h>
#include <algorithm>
#include <vector>
using namespace std;
#define ss second
#define f first
vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
	vector<pair<int,int>>p(P.size());
	for(int i=0; i<P.size(); i++){
		p[i]={P[i],i};
	}
	sort(p.begin(),p.end());
	vector<int>v;
	for(int i=0; i<p.size(); i++){
		if(A<p[i].f)break;
		else{
			A=(A-p[i].f);
			v.push_back(p[i].ss);
		}
	}
  	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...