#include <bits/stdc++.h>
#define fi first 
#define se second
using namespace std;
using ll = long long ;
ll n,ans,tong;
vector<ll>x;
pair<ll,ll> p[500005];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++) 
        cin>>p[i].fi>>p[i].se;
    sort(p+1,p+n+1);
    x.push_back(p[1].se);
    for(int i=2;i<=n;i++)
    {
        x.push_back(p[i-1].fi-p[i].fi);
        x.push_back(p[i].se);
    }
    for(int i=0;i<x.size();i++)
    {
        tong+=x[i];
        if(tong<0) tong=0;
        ans=max(ans,tong);
    }
    cout<<ans;
    return 0;
}
| # | 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... |