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 ll long long
using namespace std;
ll n, dp[500001];
pair <ll, ll> p[500001];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p+n);
dp[0] = p[0].second;
for(int i = 1; i < n; i++) {
dp[i] = max(p[i].second, dp[i-1] + p[i].second - p[i].first + p[i-1].first);
}
sort(dp, dp+n);
cout << dp[n-1];
}
# | 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... |