| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1308002 | dimitris71 | Art Exhibition (JOI18_art) | C11 | 0 ms | 0 KiB |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
vector < pair < long long, int > > X;
int main() {
int N; long long res = 0, best = 1e18, sum = 0;
scanf("%d", &N); X.resize(N);
for (int i=0; i<N; i++) {
long long a; int b;
scanf("%lld%d", &a, &b);
X[i] = make_pair(a, b);
}
sort(X.begin(), X.end());
for (int i=0; i<N; i++) {
best = min(best, sum - X[i].first);
sum += X[i].second;
res = max(res, sum - X[i].first - best);
}
printf("%lld\n", res);
}
