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 int long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
signed main(){
int n;
cin>>n;
vector<pii> v(n);
for(auto &i:v) cin>>i.F>>i.S;
sort(v.begin(),v.end(),[](auto i,auto j){
return i.F<j.F;
});
int ans=0;
int dif=0,mxdif=0,tmp=v[0].S;
for(int i=1;i<n;i++){
dif+=v[i].F-v[i-1].F;
dif-=v[i-1].S;
mxdif=max(mxdif,dif);
tmp+=v[i].S-(v[i].F-v[i-1].F);
ans=max(ans,tmp+mxdif);
}
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... |