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 <algorithm>
using namespace std;
const long long INF = 1e18;
int main(){
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
pair<long long, long long> a[n];
for (int i = 0; i < n; i++)
cin >> a[i].first >> a[i].second;
sort(a, a + n);
long long pref[n + 1]{};
for (int i = 0; i < n; i++)
pref[i + 1] = pref[i] + a[i].second;
long long ans = -INF;
for (int i = 0; i < n; i++){
for (int j = i; j < n; j++){
ans = max(ans, pref[j + 1] - pref[i] - (a[j].first - a[i].first));
}
}
cout << ans << '\n';
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... |