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 int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ar = array<int, 2>;
const int64_t INF = 1ll << 60;
const int N = 5e5 + 5;
int n, ps[N];
ar a[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
FOR(i, 1, n + 1) cin >> a[i][0] >> a[i][1];
sort(a + 1, a + n + 1);
int ps = 0, ans = 0, mx = 0;
FOR(i, 1, n + 1) {
mx = max(mx, -ps + a[i][0]);
ps += a[i][1];
ans = max(ans, ps + mx - a[i][0]);
}
cout << ans << '\n';
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... |