# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134240 | Boxworld | Art Exhibition (JOI18_art) | C++14 | 277 ms | 20984 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;
const int maxN=500010;
struct art{ll size,val;}a[maxN];
bool cmp(art x,art y){return x.size<y.size;}
int main(){
int n;
scanf("%d",&n);
for (int i=0;i<n;i++)scanf("%lld%lld",&a[i].size,&a[i].val);
sort(a,a+n,cmp);
ll ans=0,best=a[0].size,val=0;
for (int i=0;i<n;i++){
val+=a[i].val;
ans=max(ans,val+best-a[i].size);
best=max(best,a[i+1].size-val);
}
printf("%lld\n",ans);
}
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... |