제출 #1336995

#제출 시각아이디문제언어결과실행 시간메모리
1336995aritro_축제 (IOI25_festival)C++20
0 / 100
36 ms5052 KiB
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()

vector<int> max_coupons(int s,vector<int>p,vector<int>t){
    int n=p.size();
    vector<pair<int,int>>a(n);
    for(int i=0;i<n;i++) a[i]={p[i],i};
    sort(all(a));
    vector<int> ans;
    int money=s;
    for(int i=0;i<n;i++){
        if(a[i].ff>money) break;
        money-=a[i].ff;
        ans.pb(a[i].ss+1);
    }
    return ans;
}
#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...