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 st first
#define nd second
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
vector<pair<ll, int> > V(n);
for(auto &i:V){
cin>>i.st>>i.nd;
}
sort(V.begin(), V.end());
ll s=0, m=-V.back().st;
ll ans=m;
for(int i=0; i<n; i++){
//cout<<s<<" "<<m<<" "<<V[i].st<<" "<<V[i].nd<<"\n";
if(i)ans=max(ans, s+m-V[i-1].st);
m=max(m, V[i].st-s);
s+=V[i].nd;
}
cout<<ans<<"\n";
}
# | 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... |