This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///
/// NOW'S YOUR CHANCE TO BE A [[BIG SHOT]]!!
///
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 200010;
pair<ll,ll> a[N];
ll dp[N];
int n;
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i].first >> a[i].second;
sort(a,a+n);
for(int i = 0; i < n; ++i)
dp[i+1] = max(a[i].first+a[i].second, dp[i]+a[i].second);
ll ans = 0;
for(int i = 0; i < n; ++i)
ans = max(ans, dp[i+1]-a[i].first);
cout << ans << '\n';
}
# | 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... |