Submission #1286630

#TimeUsernameProblemLanguageResultExecution timeMemory
1286630kawhietFestival (IOI25_festival)C++20
5 / 100
51 ms9580 KiB
#include <bits/stdc++.h>
#include "festival.h"
using namespace std;

vector<int> max_coupons(int A, vector<int> p, vector<int> t) {
  int n = p.size();
  vector<array<int, 3>> a(n);
  for (int i = 0; i < n; i++) {
    a[i] = {p[i], t[i], i};
  }
  sort(a.begin(), a.end());
  vector<int> res;
  for (int i = 0; i < n; i++) {
    if (A >= a[i][0]) {
      A = (A - a[i][0]) * a[i][1];
      res.push_back(a[i][2]);
    } else {
      break;
    }
  }
  return res;
}
#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...