# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127403 | FutymyClone | Art Exhibition (JOI18_art) | C++14 | 270 ms | 18364 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>
using namespace std;
const int N = 5e5 + 5;
int n;
pair <long long, long long> a[N];
long long ans = -1e18, res = -1e18;
int main(){
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld %lld", &a[i].first, &a[i].second);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) a[i].second += a[i - 1].second;
for (int i = 1; i <= n; i++) {
res = max(res, a[i].first - a[i - 1].second);
ans = max(ans, a[i].second - a[i].first + res);
}
printf("%lld", ans);
return 0;
}
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... |