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>
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
using namespace std;
int n, ans = 0, dp[500000];
pair <int, int> pr[500000];
int solve(int i)
{
if (i == 0)
return pr[0].second;
if (~dp[i])
return dp[i];
return dp[i] = max(pr[i].second, solve(i-1)+pr[i-1].first+pr[i].second-pr[i].first);
}
signed main()
{
IOS;
memset(dp, -1, sizeof dp);
cin >> n;
for (int i = 0; i < n; i++)
cin >> pr[i].first >> pr[i].second;
sort(pr, pr+n);
for (int i = n-1; i >= 0; i--)
ans = max(ans, solve(i));
cout << ans;
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... |