#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<int64_t, int64_t>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
vector<int64_t> p(n + 1);
for (int i = 0; i < n; i++) {
p[i + 1] = p[i] + a[i].second;
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
ans = max(ans, p[j + 1] - p[i] - (a[j].first - a[i].first));
}
}
// int64_t sum = 0, ans = 0;
// for (int l = 0, r = 0; r < n; r++) {
// sum = sum + a[r].second;
// ans = max(ans, sum - (a[r].first - a[l].first));
// if (sum - a[l].second - (a[r].first - a[l + 1].first) > ans) {
// ans = sum - a[l].second - (a[r].first - a[l + 1].first);
// l++;
// }
// }
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... |