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 int long long
#define fi first
#define se second
using namespace std;
const int N = 5e5 + 11;
pair<int, int> a[N];
int pref[N];
int cost(int i, int j) {
int sum = pref[j] - pref[i - 1];
int mx = a[j].fi, mn = a[i].fi;
return sum - (mx - mn);
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin>>a[i].fi>>a[i].se;
}
sort(a + 1, a + 1 + n);
for(int i = 1; i <= n; i++){
pref[i] = pref[i - 1] + a[i].se;
}
//i-th, pref[i] - a[i].fi
//j-th -pref[j - 1] + a[j].fi
set<int> st;
st.insert(0);
int ans = 0;
for(int i = 1; i <= n; i++) {
st.insert((-pref[i - 1] + a[i].fi));
int value = *st.rbegin();
ans = max(ans, (pref[i] - a[i].fi) + value);
}
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... |