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;
int n;
pair<long long, int> a[500002];
int main() {
cin >> n;
long long ans = 0, mx = 0;
for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
auto x = a[i].first;
auto y = a[i].second;
long long r = mx + y - x;
r = max(r, 1ll * y);
ans = max(ans, r);
mx = max(mx, r + x);
}
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... |