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