Submission #722639

#TimeUsernameProblemLanguageResultExecution timeMemory
722639AndrijaMArt Exhibition (JOI18_art)C++14
100 / 100
558 ms21048 KiB
#include <bits/stdc++.h> using ll=long long; using namespace std; int main() { long long n; cin>>n; long long s,v; vector<pair<long long,long long>>x; for(long long i=0;i<n;i++) { cin>>s>>v; x.push_back({s,v}); } sort(x.begin(),x.end()); long long ans=0; long long mx=0; for(long long i=0;i<n;i++) { if(i==0) { mx=x[i].first+x[i].second; ans=max(ans, mx-x[i].first); } else { mx=max(mx+x[i].second,x[i].second+x[i].first); ans=max(ans, mx-x[i].first); } } 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...