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>
using namespace std;
#define int long long
#define fi first
#define se second
int N;
pair<int,int>P[500005];
signed main()
{
cin>>N;
for(int i = 1;i<=N;i++){
cin>>P[i].fi>>P[i].se;
}
sort(P+1,P+1+N);
for(int i = 2;i<=N;i++){
P[i].se+=P[i-1].se;
}
// for(int i = 0;i<=N;i++){
// cout<<P[i].fi<<":"<<P[i].se<<endl;
// }
int ans=-1e18;
for(int i = 1;i<=N;i++){
for(int j = i;j<=N;j++){
ans=max(ans,(P[j].se-P[i-1].se)-(P[j].fi-P[i].fi));
}
}
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... |