Submission #294234

#TimeUsernameProblemLanguageResultExecution timeMemory
294234dolijanArt Exhibition (JOI18_art)C++14
100 / 100
219 ms25324 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; vector<pair<ll,ll> > v; vector<ll> p; const ll INF=-1e18; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n; cin>>n; v.resize(n); for(ll i=0;i<n;i++) cin>>v[i].first>>v[i].second; sort(v.begin(),v.end()); p.push_back(0); for(ll i=0;i<n;i++) p.push_back(p[i]+v[i].second); ll mx=INF; ll best=INF; for(ll i=0;i<n;i++) { best=max(v[i].first-p[i],best); mx=max(p[i+1]-v[i].first+best,mx); } cout<<mx<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...