#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
int const N=5e5+10;
pair<int,int> a[N];
int sum[N];
int ma=-1000000000;
signed main()
{
cin.tie(0)->sync_with_stdio(false);
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].fi>>a[i].se;
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i].se;
}
int ma = 0, res = 0;
for(int i = 1; i <= n; i ++) {
ma = max(ma, a[i].fi - sum[i - 1]);
res = max(res, ma + sum[i] - a[i].fi);
}
cout<<res;
}
# | 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... |