# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225456 | Nightlight | Art Exhibition (JOI18_art) | C++14 | 295 ms | 21112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define pii pair<long long, long long>
#define a first
#define b second
using namespace std;
int N;
pii A[500005];
long long ans, best = -1e9;
//pre[i] - pre[j - 1] - (A[i] - A[j])
//pre[i] - A[i] + (A[j] - pre[j - 1])
int main() {
// freopen("inp", "r", stdin);
scanf("%d", &N);
for(int i = 1; i <= N; i++) {
scanf("%lld %lld", &A[i].a, &A[i].b);
}
sort(A + 1, A + N + 1);
for(int i = 1; i <= N; i++) {
A[i].b += A[i - 1].b;
best = max(best, A[i].a - A[i - 1].b);
ans = max(ans, A[i].b - A[i].a + best);
}
printf("%lld\n", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |