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;
int main () {
int n; cin >> n;
vector<pair<LL, LL>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
set<LL> s;
LL sum = 0;
LL ans = 0;
for (int i = 0; i < n; i++) {
s.insert(sum - a[i].first);
sum += a[i].second;
ans = max(ans, (sum - a[i].first) - (*(s.begin())));
}
cout << ans << '\n';
}
# | 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... |