Submission #85894

#TimeUsernameProblemLanguageResultExecution timeMemory
85894igziArt Exhibition (JOI18_art)C++17
100 / 100
784 ms224372 KiB
#include <bits/stdc++.h> #define maxN 500005 using namespace std; long long ans=0,n,i,tmp=LLONG_MIN,s; pair<long long,long long> a[maxN]; int main() { cin>>n; for(i=0;i<n;i++) cin>>a[i].first>>a[i].second; sort(a,a+n); s=0; for(i=0;i<n;i++){ tmp=max(tmp,a[i].first-s); s+=a[i].second; ans=max(ans,s-a[i].first+tmp); } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...