# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127260 | hungcung | Art Exhibition (JOI18_art) | C++17 | 2 ms | 376 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;
long long n,sum[500005],ans=INT_MIN;
pair<long long,long long> a[500005];
int main(){
scanf("%lld",&n);
for(long long i=1;i<=n;i++){
scanf("%lld %lld",&a[i].first,&a[i].second);
}
sort(a+1,a+n+1);
for(long long i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i].second;
}
for(long long i=1;i<=n;i++){
for(long long j=i+1;j<=n;j++){
if(sum[j]-sum[i-1]-(a[j].first-a[i].first)>ans) ans=sum[j]-sum[i-1]-(a[j].first-a[i].first);
}
}
printf("%lld",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... |