# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75106 | bogdan10bos | Art Exhibition (JOI18_art) | C++14 | 279 ms | 227196 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 FILE_IO
typedef long long LL;
typedef pair<LL, LL> pll;
int N;
pll v[500005];
int main()
{
#ifdef FILE_IO
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
#endif
scanf("%d", &N);
for(int i = 1; i <= N; i++)
{
LL x, y;
scanf("%lld%lld", &x, &y);
v[i] = {x, y};
}
sort(v + 1, v + N + 1);
LL ans = -(1LL << 60), sum = 0LL, bst = -(1LL << 60);
for(int i = 1; i <= N; i++)
{
bst = max(bst, v[i].first - sum);
sum += v[i].second;
ans = max(ans, sum - v[i].first + bst);
}
printf("%lld\n", ans);
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... |