Submission #1329769

#TimeUsernameProblemLanguageResultExecution timeMemory
1329769SpyrosAlivFestival (IOI25_festival)C++20
5 / 100
38 ms5680 KiB
#include "festival.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long 

int n, tot;

vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
  n = P.size();
  tot = A;
  vector<pair<int, int>> vals;
  for (int i = 0; i < n; i++) vals.push_back({P[i], i});
  sort(vals.begin(), vals.end());
  vector<int> ans;
  for (auto x: vals) {
    if (x.first <= tot) {
      tot -= x.first;
      ans.push_back(x.second);
    }
  }
  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...