# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77114 | Vardanyan | Art Exhibition (JOI18_art) | C++14 | 1078 ms | 11288 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;
const int N = 500*1000+7;
pair<long long,long long> a[N];
int main(){
int n;
scanf("%d",&n);
for(int i = 1;i<=n;i++) scanf("%lld%lld",&a[i].first,&a[i].second);
sort(a+1,a+1+n);
long long ans = 0;
for(int i = 1;i<=n;i++){
long long mx = 0;
long long mn = 10000000000000005;
long long s = 0;
for(int j = i;j<=n;j++){
mx = max(mx,a[j].first);
mn = min(mn,a[j].first);
s+=a[j].second;
ans = max(ans,s-(mx-mn));
}
}
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... |