Submission #1097924

#TimeUsernameProblemLanguageResultExecution timeMemory
1097924NewtonabcArt Exhibition (JOI18_art)C++14
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> #define mp make_pair using namespace std; vector<pair<long long,long long> > v; int main(){ int n,st=0; long long cur=0; cin>>n; for(int i=0;i<n;i++){ long long a,b; cin>>a >>b; v.push_back(mp(a,b)); } long long ans=LLONG_MIN; sort(v.begin(),v.end()); for(int i=0;i<n;i++){ if(i) cur-=v[i].first-v[i-1].first; cur+=v[i].second; while(cur<0){ st++; cur+=v[st].first-v[st-1].first; cur-=v[st-1].second; } ans=max(ans,cur); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...