#include <vector>
#include <algorithm>
using namespace std;
vector<int> max_coupons(int A, vector<int> P, vector<int> T) {
int N = P.size();
vector<int> indices(N);
for (int i = 0; i < N; ++i) {
indices[i] = i;
}
// Sort indices based on P[i]/T[i] ascending
sort(indices.begin(), indices.end(), [&P, &T](int a, int b) {
return (long long)P[a] * T[b] < (long long)P[b] * T[a];
});
vector<int> result;
long long current = A;
for (int idx : indices) {
if (current >= P[idx]) {
current = (current - P[idx]) * T[idx];
result.push_back(idx);
}
}
return result;
}
# | 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... |