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