| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307437 | ballbreaker | Art Exhibition (JOI18_art) | C++20 | 126 ms | 12096 KiB |
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2")
#define all(a) a.begin(),a.end()
using namespace std;
#define int long long
void gogo() {
int n;
cin >> n;
pair<int, int>seg[n + 1];
for (int i = 1; i <= n; i++) {
cin >> seg[i].first >> seg[i].second;
}
sort(seg + 1, seg + n + 1);
int pref[n + 1] = {};
for (int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + seg[i].second;
}
int ans = 0;
int sum = 0;
for (int l = 1; l <= n; l++) {
sum += seg[l].second;
}
int mx = -LLONG_MAX / 2;
for (int l = n; l >= 1; l--) {
mx = max(mx, pref[l] - seg[l].first);
ans = max(ans, - pref[l - 1] + seg[l].first + mx);
}
cout << ans << endl;
}
main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t = 1;
// cin >> t;
while (t--) {
gogo();
}
} 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... | ||||
