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;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<ll, ll>> v(n);
for (auto &[a, b] : v) cin >> a >> b;
sort(begin(v), end(v));
ll dp = v[0].second;
ll ans = v[0].second;
for (int i = 1; i < n; ++i) {
dp = max(dp + v[i].second - (v[i].first - v[i - 1].first), v[i].second);
ans = max(ans, dp);
}
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... |