Food

#include <bits/stdc++.h>
using namespace std;


bool comp(const pair<int, int>& i, const pair<int, int>& j) {
    if (i.second == j.second) {
        return i.first < j.first;
    }
    return i.second+i.first > j.second+j.first;
}

int main() {
    cin.sync_with_stdio(0);
    int n;
    cin >> n;

    // first = order delay
    // second = delivery delay
    vector<pair<int, int>> times;
    for (int i=0;i<n;i++) {
        int a, b;
        cin >> a >> b;
        times.push_back(make_pair(a,b ));
    }

    sort(times.begin(), times.end(), comp);

    int biggest = 0;
    int start = 0;
    for (auto item : times) {
        start += item.first;
        biggest = max(biggest, start + item.second);
    }

    cout << biggest << "\n";

}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER