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 MAXN 500005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)
#define f first
#define s second
ll n, mnp[MAXN], sp[MAXN], vp[MAXN], r = 0;
pair<ll, ll> w[MAXN];
int main(){
cin >> n;
FOR(i, 1, n) cin >> w[i].f >> w[i].s;
sort(w + 1, w + 1 + n);
vp[0] = 0, sp[0] = LLONG_MIN;
FOR(i, 1, n){
vp[i] = vp[i - 1] + w[i].s;
mnp[i] = - vp[i - 1] + w[i].f;
sp[i] = max(sp[i - 1], mnp[i]);
r = max(r, vp[i] - w[i].f + sp[i]);
}
cout << r << 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... |