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
const int MXN = 500005;
int n;
pair<int, int> arr[MXN];
int a[MXN], b[MXN], p[MXN];
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i=1; i<=n; i++) {
cin >> arr[i].first >> arr[i].second;
}
sort(arr+1, arr+n+1);
for (int i=1; i<=n; i++) {
a[i] = arr[i].first, b[i] = arr[i].second;
p[i] = p[i-1] + b[i];
}
int t = a[1];
int best = 0;
for (int i=1; i<=n; i++) {
t = max(t, -p[i-1] + a[i]);
best = max(best, p[i] - a[i] + t);
}
cout << best << 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... |