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;
#define int long long
signed main()
{
int n;
cin >> n;
pair<int,int> a[n*2];
for (int i = 1; i <= n; ++i) {
cin >> a[i].first >> a[i].second;
}
sort(a+1,a + n + 1);
vector<int> dp(n + 1);
int ans = 0;
for (int i = 1; i <= n; ++i) {
dp[i] = max(dp[i - 1] + a[i].second, a[i].first + a[i].second);
ans = max(ans, dp[i] - a[i].first);
}
cout << ans;
}
# | 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... |