#include <bits/stdc++.h> using namespace std; #define int long long signed main(){ int n; cin >> n; vector<pair<int, int>> v(n); for(int i = 0; i < n; i++){ cin >> v[i].first >> v[i].second; }sort(v.begin(), v.end()); vector<int> p(n); p[0] = v[0].second; for(int i = 1; i < n; i++){ p[i] = p[i-1] + v[i].second; }int ans = INT_MIN; int mn = -v[0].first; for(int i = 0; i < n; i++){ ans = max(ans, p[i] - v[i].first - mn); mn = min(mn, p[i] - v[i+1].first); }cout << ans; }