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;
using ll = long long;
const ll NINF = -1e18;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<array<ll, 2>> v(n+1);
vector<ll> pref(n+1);
for(int i = 1; i <= n; i++) {
cin >> v[i][0] >> v[i][1];
}
sort(v.begin(), v.end());
for(int i = 1; i <= n; i++) {
pref[i] = v[i][1] + pref[i-1];
}
ll ans = pref[1];
ll mx = v[1][0];
for(int i = 2; i <= n; i++) {
mx = max(mx, v[i][0] - pref[i-1]);
ans = max(ans, pref[i]-v[i][0] + mx);
}
cout << ans;
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... |