#include <bits/stdc++.h>
#include "festival.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(v) v.begin(), v.end()
constexpr ll inf = 1ll << 62ll;
mt19937 mt(34056237);
ll _ = 0;
vector<int> max_coupons(int A, vector<int> price, vector<int> type) {
ll n = price.size();
vector<vector<pll>> coups(4+1);
for (ll i = 0; i < n; i++) {
coups[type[i]].emplace_back(price[i], i);
}
for (ll i = 1; i <= 4; i++) sort(all(coups[i]));
vector<int> res;
for (ll i = 0; i < coups[1].size(); i++) {
A -= coups[1][i].first;
if (A < 0) break;
res.push_back(coups[1][i].second);
}
return res;
}
#ifdef TEST
#include "grader.cpp"
#endif
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |