# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101795 | SulA | Art Exhibition (JOI18_art) | C++17 | 140 ms | 8440 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcountll
using namespace std;
using namespace __gnu_pbds;
using namespace chrono;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int n; cin >> n;
#define cost first
#define value second
pair<long long,long long> a[n];
for (int i = 0; i < n; cin >> a[i].cost >> a[i++].value);
sort(a, a + n);
// p[i] - a[i] + a[j] - p[j-1]
long long sum = 0, pref = 0, ans = 0;
for (int i = 0; i < n; i++) {
pref = max(pref, a[i].cost - sum);
sum += a[i].value;
ans = max(ans, sum - a[i].cost + pref);
// ans = max(ans, a[i].value);
}
cout << ans;
}
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... |