#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
using ll=long long;
const int N=5e5;
pair<ll,ll>a[N+5];
int n;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n;
for(int i=1;i<=n;++i)
cin>>a[i].fi>>a[i].se;
sort(a+1,a+1+n);
ll ans=0;
for(int i=1;i<=n;++i)
ans=max(ans,a[i].se);
ll cur=0,mn=0;
for(int i=1;i<=n;++i){
mn=min(mn,cur-a[i].fi);
cur+=a[i].se;
ll res=cur-a[i].fi;
ans=max(ans,res-mn);
}
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... |