#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
vector<pair<int,int>> vec = {{0, 0}};
for (int i=1, A, B;i<=n;i++){
cin>>A>>B;
vec.push_back({A, B});
}
sort(begin(vec), end(vec));
int sum = 0, Mx = -1e17, Ans = 0;
for (auto [A, B] : vec){
Mx = max(Mx, -sum + A);
sum += B;
Ans = max(Ans, sum - A + Mx);
}
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... |