poj 3045

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define ms(a,b) memset(a,b,sizeof(a))

using namespace std;

struct node {
	ll x, y;
	friend bool operator<(const node &a, const node &b) {
		return a.x + a.y < b.x + b.y;
	}
};

ll wi,ans;
int n;
node demo[55555];

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%lld%lld", &demo[i].x,&demo[i].y);
	}

	//ans = 0;
	ans = -(1<<29);
	wi = 0;
	sort(demo, demo + n);

	for (int i = 0; i < n; i++) {
		ans = max(ans, wi-demo[i].y);
		wi += demo[i].x;
	}
	printf("%lld\n", ans);

	return 0;
}