This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;
pair<int,int>ar[1000006];int ps[1000006];
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>ar[i].first>>ar[i].second;
}
sort(ar+1,ar+n+1);
for(int i=1;i<=n;i++){
ps[i]=ar[i].second+ps[i-1];
}
int ans=-1e17;
int mnad=0+ar[1].first;
for(int i=1;i<=n;i++){
ans=max(ans,mnad+ps[i]-ar[i].first);
mnad=max(mnad,-ps[i]+ar[i+1].first);
}
cout<<ans<<endl;
}
# | 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... |