http://acm.hdu.edu.cn/showproblem.php?pid=4296
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int maxn=100002;
const int inf=1<<29;
int n;
struct node
{
int w,s;
}p[maxn];
int cmp(node a,node b)
{
return a.w+a.s<=b.w+b.s;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
int i,j;
__int64 sum=0,ans;
for(i=0;i<n;i++)
{
scanf("%d%d",&p[i].w,&p[i].s);
}
sort(p,p+n,cmp);
ans=-inf;
for(i=0;i<n;i++)
{
if(ans<sum-p[i].s) ans=sum-p[i].s;
sum+=p[i].w;
}
if(ans<0) printf("0\n");
else printf("%I64d\n",ans);
}
return 0;
}