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;
using ll=long long;
const int MAX=5*1e5+7;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
ll a, b;
vector<pair<ll, ll>> prace;
for (int i=0; i<n; i++){
cin >> a >> b;
prace.push_back({a, b});
}
sort(prace.begin(), prace.end());
ll pref[MAX];
pref[0] = 0;
pref[1] = prace[0].second;
for (int i=2; i<=n; i++) pref[i] = pref[i-1] + prace[i-1].second-(prace[i-1].first-prace[i-2].first);
pref[n+1] = pref[n]+prace[n-1].second;
ll wyn=0, mmin=pref[0];
for (int i=1; i<=n+1; i++){
//cout << pref[i] << " " << mmin << endl;
mmin = min(mmin, pref[i]);
wyn = max(wyn, pref[i]-mmin);
}
cout << wyn << "\n";
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... |