#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
ll i,j;
int main(){
  ll n; cin>>n;
  vector<pair<ll,ll>> a(n);
  for(i=0; i<n; i++){
    cin>>a[i].ff>>a[i].ss;
  }
  sort(a.begin() , a.end());
  ll b[n];
  b[0]=a[0].ss;
  for( i=1; i<n; i++){
    b[i]=max(a[i].ss , b[i-1]+a[i].ss- ( a[i].ff- a[i-1].ff));
  }
  ll ans=0;
  for(ll i=0; i<n; i++){
    ans=max(b[i],ans);
  }
  cout<<ans;
}
| # | 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... |