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 pll pair<ll, ll>
#define fi first
#define se second
const int ar = 5e4 + 5;
int n;
pll a[ar];
ll Max[ar];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i) cin >> a[i].fi >> a[i].se;
sort(a + 1, a + n + 1);
ll sum = 0, ans = 0;
for(int i = 1; i <= n; ++i) {
sum += a[i].se;
Max[i] = sum - a[i].fi;
}
for(int i = n; i; --i) Max[i] = max(Max[i], Max[i + 1]);
sum = 0;
for(int i = 1; i <= n; ++i) {
ans = max(ans, Max[i] + a[i].fi - sum);
sum += a[i].se;
}
cout << ans;
}
# | 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... |