Submission #1326191

#TimeUsernameProblemLanguageResultExecution timeMemory
1326191heheFestival (IOI25_festival)C++20
5 / 100
40 ms7712 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

vector<signed> max_coupons(signed a, vector<signed> price, vector<signed> type){
    int n = price.size();
    vector<pair<int, int>> val;

    for(int i = 0; i < n; i++){
        val.push_back({price[i], i});
    }

    sort(val.begin(), val.end());

    int i = 0;
    vector<signed> ans;
    while(i < n && a >= val[i].first){
        a-= val[i].first;
        ans.push_back(val[i].second);
        i++;
    }

    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...