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 f first
#define s second
using namespace std;
const int N=1e6+6;
long long ans,n,mn,k,cur;
pair<long long,long long>p[N];
int main(){
cin>>n;
mn=1e16;
for(k=1;k<=n;k++){
cin>>p[k].f>>p[k].s;
ans=max(ans,p[k].s);
}
sort(p+1,p+n+1);
for(k=1;k<=n;k++){
mn=min(mn,cur-p[k].f);
cur+=p[k].s;
ans=max(ans,cur-mn-p[k].f);
}
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... |