AcWing 125. 耍杂技的牛
原题链接
中等
作者:
SZU_ZYJ
,
2025-04-13 22:20:52
· 广东
,
所有人可见
,
阅读 2
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 500010;
typedef pair<int, int> PII;
PII cow[N];
int n;
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
int w, s;
cin >> w >> s;
cow[i] = { w + s,w };
}
sort(cow, cow + n);
int res = -2e9;
int sum = 0;
for (int i = 0; i < n; i++)
{
int w = cow[i].second;
int s = cow[i].first - cow[i].second;
res = max(res, sum - s);
sum += w;
}
cout << res << endl;
return 0;
}