耍杂技的牛---------------------------思维(贪心)

解析:
贪心按照wi+si 从小到大排序即可，然后模拟就行

#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N=1e5+100;
typedef long long ll;
typedef pair<ll,ll> PLL;
PLL q[N];
int n;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>q[i].x>>q[i].y;
		q[i].x+=q[i].y;
	}
	sort(q+1,q+1+n);
	ll res=-1e18,sum=0;
	for(int i=1;i<=n;i++)
	{
		res=max(res,sum-q[i].y);
		sum+=q[i].x-q[i].y;
	}
	cout<<res<<endl;
}