# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41102 | abeker | Art Exhibition (JOI18_art) | C++14 | 290 ms | 8556 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;
typedef long long ll;
typedef pair <ll, ll> pii;
const int MAXN = 5e5 + 5;
const ll INF = 1e18;
int N;
pii p[MAXN];
void load() {
scanf("%d", &N);
for (int i = 1; i <= N; i++)
scanf("%lld%lld", &p[i].first, &p[i].second);
}
ll solve() {
sort(p + 1, p + N + 1);
ll mini = INF, sol = -INF;
for (int i = 1; i <= N; i++) {
p[i].second += p[i - 1].second;
mini = min(mini, p[i - 1].second - p[i].first);
sol = max(sol, p[i].second - p[i].first - mini);
}
return sol;
}
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... |