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<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define ll long long
const ll maxn=500001;
ll n,ans=0;
pair<ll,ll> art[maxn];
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>art[i].first>>art[i].second;
}
sort(art,art+n);
for(int i=0;i<n;i++){
ll su=0;
for(int j=i;j<n;j++){
su+=art[j].second;
ans=max(ans,su-(art[j].first-art[i].first));
}
}
cout<<ans<<endl;
return 0;
}
# | 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... |