0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 03:11:58 +00:00
https://sjzezoj.com/submission/51873
This commit is contained in:
Baoshuo Ren 2022-03-28 16:50:52 +08:00
parent f3eed19169
commit 9675b07460
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

35
S2OJ/399/399.cpp Normal file
View File

@ -0,0 +1,35 @@
#include <algorithm>
#include <iostream>
#include <limits>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 1e5 + 5;
int n;
long long sum[N], ans = std::numeric_limits<int>::min();
std::pair<int, int> a[N];
int main() {
std::ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].first >> a[i].second;
}
std::sort(a + 1, a + 1 + n, [](std::pair<int, int> a, std::pair<int, int> b) -> bool {
return a.first + a.second < b.first + b.second;
});
for (int i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i].first;
ans = std::max(ans, sum[i - 1] - a[i].second);
}
cout << ans << endl;
return 0;
}