Food

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;


vector<pair<long long, long long> > t;

int main(){
  int n;
  cin >> n;
  for (int i=0; i<n; ++i){
    int a, b;
    cin >> a >> b;
    t.push_back(make_pair(-b, a));
  }
  sort(t.begin(), t.end());
  long long tm=0;
  long long s=0;
  for (int i=0; i<n; ++i){
    s+=t[i].second;
    tm=max(tm, -t[i].first+s);
  }
  cout << tm << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED