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;
typedef long long ll;
typedef long double ld;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll, ll>> art(n);
for (int i = 0; i < n; ++i) cin >> art[i].first >> art[i].second;
sort(art.begin(), art.end());
ll mn = 1e18, sum = 0;
ll ans = 0;
for (int i = 0; i < n; ++i) {
mn = min(mn, -art[i].first + sum);
sum += art[i].second;
ans = max(ans, -art[i].first + sum - mn);
}
cout << ans << endl;
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... |