# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127228 | tuanasanh | Art Exhibition (JOI18_art) | C++11 | 267 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>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define ii pair<int,int>
#define int long long
using namespace std;
const int N=5e5+5;
ii a[N];
int n,s=0,tmp=-N*1000,ans=-N*1000,u,v;
signed main(){
// freopen(".inp","r",stdin);
// freopen(".out","w",stdout);
// ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
scanf("%lld",&n);
for(int i=0;i<n;i++){
scanf("%lld %lld",&u,&v);
a[i]={u,v};
}
sort(a,a+n);
for(int i=0;i<n;i++){
tmp=max(tmp,a[i].first-s);
s+=a[i].second;
ans=max(ans,s-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... |