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 ll long long
#define pll pair<ll,ll>
#define fi first
#define se second
ll N;
pll arr[500100];
ll psum[500100];
ll ans, maks;
int main()
{
cin >> N;
for(int i=1; i<=N; i++) {
cin >> arr[i].fi >> arr[i].se;
}
sort(arr+1, arr+N+1);
for(int i=1; i<=N; i++) {
psum[i] = psum[i-1] + arr[i].se;
}
for(int i=N; i>=1; i--) {
maks = max(maks, psum[i]-arr[i].fi);
ans = max(ans, maks + arr[i].fi-psum[i-1]);
}
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... |