#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;
pair<int, int> a[500001];
int dp[500002];
signed main(){
int n;
cin >> n;
for (int i = 1;i<=n;++i){
cin >> a[i].fi >> a[i].se;
}
sort(a+1, a+n+1);
dp[0] = 0;
for (int i = 1;i<=n;++i){
dp[i] = dp[i-1] + a[i].se;
}
int res = 0;
for (int i = 1;i<=n;++i){
for (int j = i-1;j>=0;--j){
res = max(res, dp[i] - dp[j] - a[i].fi + a[j+1].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... |