Submission #74050

#TimeUsernameProblemLanguageResultExecution timeMemory
74050Bodo171Art Exhibition (JOI18_art)C++14
100 / 100
347 ms8696 KiB
#include <iostream> #include <fstream> #include <algorithm> #include <climits> using namespace std; const int nmax=500005; pair<long long,int> v[nmax]; int n,i; long long mn,s,ans; int main() { ios_base::sync_with_stdio(false); cin>>n; for(i=1;i<=n;i++) { cin>>v[i].first>>v[i].second; } sort(v+1,v+n+1);mn=LLONG_MAX; for(i=1;i<=n;i++) { mn=min(mn,1LL*s-v[i].first); s+=1LL*v[i].second; ans=max(ans,1LL*s-mn-v[i].first); } cout<<ans; 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...