제출 #1281509

#제출 시각아이디문제언어결과실행 시간메모리
1281509dimitri.shengelia축제 (IOI25_festival)C++20
5 / 100
38 ms7096 KiB
#include "festival.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
	
	vector <int> v;
	
	vector <pair<int, int>> a;
	
	for ( int i = 0; i < P.size(); i++ ) {
		
		a.push_back( { P[i], i } );
		
	}
	
	sort ( a.begin(), a.end() );
	
	for ( int i = 0; i < P.size() and A >= a[i].first; i++ ) {
		
		A -= a[i].first;
		
		v.push_back( a[i].second );
		
	}
	
  	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...