Submission #294200

#TimeUsernameProblemLanguageResultExecution timeMemory
294200dolijanArt Exhibition (JOI18_art)C++14
50 / 100
1085 ms20996 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; vector<pair<ll,ll> > v; vector<ll> p; int main() { 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=0; //for(int i=1;i<n;i++) for(ll i=0;i<n;i++) { for(ll j=i;j<n;j++) { mx=max(mx,p[j+1]-p[i]-(v[j].first-v[i].first)); } } 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...