# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163425 | iefnah06 | Art Exhibition (JOI18_art) | C++11 | 338 ms | 20984 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;
using ll = long long;
const ll INF = 4e18;
const int MAXN = 6e5;
int N;
pair<ll, int> A[MAXN];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%lld %d", &A[i].first, &A[i].second);
}
sort(A, A + N);
ll ma = -INF;
ll ans = -INF;
ll pref = 0;
for (int i = 0; i < N; i++) {
ma = max(ma, A[i].first - pref);
pref += A[i].second;
ans = max(ans, pref - A[i].first + ma);
}
printf("%lld\n", 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... |