#include <bits/stdc++.h>
struct item {
int64_t i, p, t;
};
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
const int n = P.size();
std::vector<item> a(n);
for (int i = 0; i < n; ++i) {
a[i] = {i, P[i], T[i]};
}
std::sort(a.begin(), a.end(), [&](item i, item j) {
return (j.p + i.p * i.t) * j.t < (i.p + j.p * j.t) * i.t;
});
std::vector<int> ans;
for (auto &i : a) {
ans.push_back(i.i);
}
return ans;
}
# | 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... |