Submission #349690

#TimeUsernameProblemLanguageResultExecution timeMemory
349690keta_tsimakuridzeArt Exhibition (JOI18_art)C++14
100 / 100
566 ms21100 KiB
#include<bits/stdc++.h> #define f first #define s second using namespace std; const int N=1e6+6; long long ans,n,mn,k,cur; pair<long long,long long>p[N]; int main(){ cin>>n; mn=1e16; for(k=1;k<=n;k++){ cin>>p[k].f>>p[k].s; ans=max(ans,p[k].s); } sort(p+1,p+n+1); for(k=1;k<=n;k++){ mn=min(mn,cur-p[k].f); cur+=p[k].s; ans=max(ans,cur-mn-p[k].f); } 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...