# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1254430 | badge881 | Art Exhibition (JOI18_art) | C++20 | 211 ms | 31704 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n, i, sum = 0, res = 0;
scanf("%lld", &n);
vector<pair<ll, ll>> a(n);
set<ll> s;
for (i = 0; i < n; ++i)
scanf("%lld %lld", &a[i].first, &a[i].second);
sort(a.begin(), a.end());
for (i = 0; i < n; ++i)
{
s.insert(a[i].first - sum);
sum += a[i].second;
res = max(res, sum + *s.rbegin() - a[i].first);
}
printf("%lld\n", res);
}
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... |