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;
typedef pair<ll, ll> ii;
int n;
ii a[500005];
int main(){
iostream::sync_with_stdio(0);
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i].first >> a[i].second;
}
sort(a+1,a+n+1);
ll maxPrefix = 0, ans = (ll) -1e18;
for(int i=1;i<=n;i++){
ans = max(ans, a[i].second + maxPrefix);
maxPrefix = max(0ll, maxPrefix + a[i].second - (a[i+1].first - 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... |