# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730951 | sleepntsheep | Art Exhibition (JOI18_art) | C++17 | 382 ms | 44324 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;
int main()
{
using ll = long long;
ll n, z = 0;
scanf("%lld", &n);
vector<pair<ll, ll>> v(n+1);
for (auto it = v.begin() + 1; it != v.end(); it++) scanf("%lld%lld", &it->first, &it->second);
sort(v.begin(), v.end());
set<ll> heap;
for (int i = 1; i <= n; i++)
{
v[i].second += v[i-1].second;
z = max(z, v[i].second - v[i-1].second);
if (heap.size())
z = max(z, v[i].second - v[i].first + *heap.rbegin());
heap.insert(v[i].first - v[i-1].second);
heap.insert(v[i+1].first - v[i].second);
}
printf("%lld", z);
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... |