推公式
一.耍杂技的牛
题目来源:耍杂技的牛
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
const int N = 5e4 + 5;
PII a[N];
int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i ++ )
{
int w,s;
scanf("%d %d", &w, &s);
a[i]={w+s,s};
}
sort(a, a + n);
int res = -1e9, sum = 0;
for(int i = 0; i < n; i ++ )
{
int s=a[i].second, w=a[i].first-s;
res = max(res, sum-s);//res = max(res, sum[i-1]-s[i])
sum = sum + w;//sum[i] = sum[i] + w[i]
}
cout << res << endl;
return 0;
}