0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-09-19 23:45:25 +00:00

P7667 [JOI2018] Art Exhibition

R52303722
This commit is contained in:
Baoshuo Ren 2021-07-02 21:59:11 +08:00 committed by Baoshuo Ren
parent 52f0e4c253
commit 346f5a520b
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

View File

@ -0,0 +1,30 @@
#include <bits/stdc++.h>
using namespace std;
struct node {
long long a, b;
bool operator<(const node& b) {
return a < b.a;
}
} a[500005];
int n;
long long s[500005], c, ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].a >> a[i].b;
}
sort(a + 1, a + 1 + n);
for (int i = 1; i <= n; i++) {
s[i] = s[i - 1] + a[i].b;
}
for (int i = 0; i <= n; i++) {
c = max(c, a[i].a - s[i - 1]);
ans = max(ans, s[i] - a[i].a + c);
}
cout << ans << endl;
return 0;
}