# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60402 | gusfring | Art Exhibition (JOI18_art) | C++14 | 416 ms | 227264 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;
typedef long long ll;
int N;
pair<ll, ll> a[500005];
int main(){
scanf("%d", &N);
for(int i=1; i<=N; ++i) scanf("%lld %lld", &a[i].first, &a[i].second);
sort(a + 1, a + N + 1);
ll mp = 0, ans = -1000000000000000000LL;
for(int i=1; i<=N; ++i){
ans = max(ans, a[i].second + mp);
mp = max(0ll, mp + a[i].second - (a[i + 1].first - a[i].first));
}
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... |