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;
const ll maxn = 1e6+5, inf=1e18;
ll n,pf[maxn],mx,ans;
pair<ll,ll> pic[maxn];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
for(ll i=1;i<=n;i++){
cin >> pic[i].first >> pic[i].second;
}
sort(pic+1,pic+n+1);
for(ll i=1;i<=n;i++){
pf[i] = pf[i-1] + pic[i].second;
}
// Chon doan [i...j]
// S[j] - S[i-1] - a[j] + a[i]
// = (S[j] - a[j]) + (a[i] - S[i-1])
mx = -inf;
ans = 0;
for(ll i=1;i<=n;i++){
mx = max(mx, pic[i].first - pf[i-1]);
ans = max(ans, pf[i] - pic[i].first + mx);
}
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... |