# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109978 | whyalwaysmezzz | Art Exhibition (JOI18_art) | C++14 | 137 ms | 21064 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>
#ifdef LOCAL
#define TASK "test"
#else
#define TASK "test"
#endif
using namespace std;
#define int long long
const int N = 5e5 + 5;
int n;
pair<int, int> a[N];
signed main() {
if (fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
if (fopen(TASK".err", "r")) {
freopen(TASK".err", "w", stderr);
}
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i].first >> a[i].second;
}
sort(a + 1, a + n + 1);
int sum = 0, best = -a[1].first, res = 0;
for (int i = 1; i <= n; ++i) {
sum += a[i - 1].first - a[i].first + a[i].second;
res = max(res, sum - best);
best = min(best, sum + a[i].first - a[i + 1].first);
}
cout << res;
}
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... |