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 x first
#define y second
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<pair<int, int>> p(n + 1);
for(int i = 1; i <= n; i++) {
cin >> p[i].x >> p[i].y;
}
sort(p.begin() + 1, p.end());
const int oo = 1e18;
int pref = 0, maxi = -oo, ans = -oo;
for(int i = 1; i <= n; ++i) {
pref += p[i].y;
ans = max({ans, pref + maxi - p[i].x, p[i].y});
maxi = max(maxi, p[i].x - (pref - p[i].y));
}
cout << ans << '\n';
}
# | 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... |