#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> max_coupons(int a, vector<int> p, vector<int> t){
int n = (int)p.size();
vector<int> idx(n);
for(int i = 0; i < n; i++) idx[i] = i;
sort(idx.begin(), idx.end(), [&](int l, int r){
return 1LL*p[l]*t[l]*(t[r]-1)<1LL*p[r]*t[r]*(t[l]-1);
});
return idx;
}
| # | 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... |