#include<bits/stdc++.h> using namespace std; using ll = long long; const int N=5e5+5; int n; pair<ll,ll> a[N]; ll ans=0; int main(){ cin.tie(nullptr)->sync_with_stdio(false); cin >> n; for(int i=1;i<=n;i++){ cin >> a[i].first >> a[i].second; } sort(a+1,a+n+1); for(int i=1;i<=n;i++){ ll sum=0; for(int j=i;j<=n;j++){ sum+=a[j].second; ans=max(ans,sum-(a[j].first-a[i].first)); } } cout << ans << "\n"; }