This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define maxN 500005
using namespace std;
long long ans=0,n,i,tmp=LLONG_MIN,s;
pair<long long,long long> a[maxN];
int main()
{
cin>>n;
for(i=0;i<n;i++) cin>>a[i].first>>a[i].second;
sort(a,a+n);
s=0;
for(i=0;i<n;i++){
tmp=max(tmp,a[i].first-s);
s+=a[i].second;
ans=max(ans,s-a[i].first+tmp);
}
cout<<ans<<endl;
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... |