# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110075 | maruii | Art Exhibition (JOI18_art) | C++14 | 331 ms | 21000 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 N;
pair<long long, int> p[500002];
int main(){
scanf("%d",&N);
long long ans = 0, mx = 0;
for(int i=0; i<N; ++i) scanf("%lld%d",&p[i].first,&p[i].second);
sort(p, p+N);
for(int i=0; i<N; ++i){
auto x = p[i].first;
auto y = p[i].second;
long long r = mx+y-x;
r = max(r, 1ll*y);
ans = max(ans, r);
mx = max(mx, r+x);
}
printf("%lld",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... |