| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1019942 | eldorbek_008 | Art Exhibition (JOI18_art) | C++17 | 450 ms | 48564 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
int32_t main() {
int n; cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
vector<int> p(n, a[0].second);
for (int i = 1; i < n; i++) {
p[i] = p[i - 1] + a[i].second;
}
int cur;
int ans = 0;
multiset<int> m;
for (int i = n - 1; i >= 0; i--) {
m.insert(p[i] - a[i].first);
cur = *prev(m.end()) - (i > 0 ? p[i - 1] : 0);
cur += a[i].first;
ans = max(ans, cur);
}
cout << ans << '\n';
}| # | 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... | ||||
