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>
using namespace std;
long long n,i,l,r,mx,ans; pair<long long,long long> p[500005];
int main(){
cin>>n;
for (i=1; i<=n; i++)
cin>>p[i].first>>p[i].second;
sort(p+1,p+n+1); ans=mx=LLONG_MIN;
for (r=1; r<=n; r++){
p[r].second+=p[r-1].second;
mx=max(mx,p[r].first-p[r-1].second);
ans=max(ans,p[r].second-p[r].first+mx);
}
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... |