# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1231091 | nta_2008 | Art Exhibition (JOI18_art) | C++20 | 116 ms | 8228 KiB |
#include <cstdio>
#include <algorithm>
using namespace std;
int N;
pair<long long, int> X[505050];
int main()
{
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
long long A; int B;
scanf("%lld%d", &A, &B);
X[i] = make_pair(A, B);
}
sort(X, X + N);
long long ret = 0, acc = 0, lo = 0;
for (int i = 0; i < N; ++i) {
lo = min(lo, acc - X[i].first);
acc += X[i].second;
ret = max(ret, acc - X[i].first - lo);
}
printf("%lld\n", ret);
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... |