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 ll = long long;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<ll, ll>> art;
ll a, b;
for (int i = n; i; --i) {
cin >> a >> b;
art.push_back(make_pair(a, b));
}
sort(art.begin(), art.end());
vector<ll> ps(n + 1);
for (int i = 1; i <= n; ++i) {
ps[i] += art[i - 1].second + ps[i - 1];
}
ll res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
res = max(res, ps[j + 1] - ps[i] - (art[j].first - art[i].first));
}
}
cout << res;
}
# | 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... |