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;
void solve(){
int n;
cin >> n;
pair<long long, long long> a[n];
long long p[n+1] = {0};
for(int i = 0;i < n;i++){
cin >> a[i].first >> a[i].second;
}
sort(a, a+n);
for(int i = 0;i < n;i++) p[i+1] = p[i] + a[i].second;
long long m[n];
for(int i = 0;i < n;i++) {
m[i] = i ? min(m[i-1], p[i] - a[i].first) : p[i] - a[i].first;
}
long long ans = 0;
for(int i = 0;i < n;i++)
ans = max(ans, p[i+1] - a[i].first - m[i]);
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) solve();
}
# | 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... |