Programi

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

struct pole{
    int time, run;
};
bool proverka(pole a, pole b)
{
    return a.run < b.run;
}
int main()
{
    int i, x, n, maxi=0, finalMaxi=0, j;
    cin >> n;
    pole task[n];
    for(i=0; i<n; i++) cin >> task[i].time >> task[i].run;
    sort(task, task+n, proverka);
    for(i=n-1; i>=0; i--)
    {
        maxi += task[i].time;
        if(finalMaxi<maxi+task[i].run)finalMaxi = maxi+task[i].run;
    }
    cout << finalMaxi;
    return 0;
}