# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206751 | pavement | Art Exhibition (JOI18_art) | C++17 | 251 ms | 24840 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;
#define int long long
int N, C, P[500005];
pair<int, int> T[500005];
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N;
for (int i = 1; i <= N; i++) cin >> T[i].first >> T[i].second;
sort(T + 1, T + 1 + N);
for (int i = 1; i <= N; i++) P[i] = P[i - 1] + T[i].second;
for (int i = 1, M = LLONG_MIN; i <= N; i++) {
M = max(M, -P[i - 1] + T[i].first);
C = max(C, M + P[i] - T[i].first);
}
cout << C << '\n';
}
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... |