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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
pair<ll, ll> a[n];
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
ll s[n], m[n];
sort(a, a + n);
s[0] = a[0].second;
m[0] = -a[0].first;
for (int i = 1; i < n; i++){
m[i] = min(m[i - 1], s[i - 1] - a[i].first);
s[i] = s[i - 1] + a[i].second;
}
ll res = a[0].second;
for (int i = 1; i < n; i++){
res = max(res, s[i] - a[i].first - m[i]);
}
cout << res << 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... |