#include <vector>
#include <algorithm>
std::vector<int> max_coupons(int A, std::vector<int> P, std::vector<int> T) {
    int N = P.size();
    std::vector<std::pair<int, int>> items;
    for (int i = 0; i < N; ++i) {
        items.emplace_back(P[i], i);
    }
    std::sort(items.begin(), items.end());
    std::vector<int> result;
    for (auto [price, index] : items) {
        if (A >= price) {
            A -= price;
            result.push_back(index);
        } else {
            break;
        }
    }
    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... |