mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 03:31:59 +00:00
P7667 [JOI2018] Art Exhibition
R52303722
This commit is contained in:
parent
52f0e4c253
commit
346f5a520b
30
Luogu/problem/P7667/P7667.cpp
Normal file
30
Luogu/problem/P7667/P7667.cpp
Normal 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;
|
||||
}
|
Loading…
Reference in New Issue
Block a user