# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539728 | krit3379 | Art Exhibition (JOI18_art) | C++17 | 304 ms | 28728 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 N 500005
long long qs[N],ma[N],ans;
pair<long long,long long> a[N];
int main(){
int n,i;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%lld %lld",&a[i].first,&a[i].second);
sort(a+1,a+n+1);
a[0].first=a[1].first;
for(i=1;i<=n;i++)qs[i]=a[i].second+qs[i-1];
for(i=n,ma[n+1]=-1e18;i>0;i--)ma[i]=max(qs[i]-a[i].first,ma[i+1]);
for(i=1;i<=n;i++)ans=max(ans,ma[i]-qs[i-1]+a[i].first);
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... |