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 ff first
#define ss second
using namespace std;
int n,pr[(int)5e5+5],ans=0,mn;
vector<pair<int,int>>v;
int main(){
cin>>n;
v.resize(n+1);
for(int i=1;i<=n;i++){
// int size,value;cin>>size>>value;
// v.push_back({value,size});
cin>>v[i].ff>>v[i].ss;
}
sort(v.begin()+1,v.end());
for(int i=1;i<=n;i++){
pr[i]=pr[i-1]+v[i].ss;
}mn=-v[1].ff;
for(int r=1;r<=n;r++){
ans=max(ans,pr[r]-v[r].ff-mn);
mn=min(mn,pr[r]-v[r+1].ff);
}
cout<<ans;
}
//pr[r]-pr[l-1]-(f
# | 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... |