Submission #996133

#TimeUsernameProblemLanguageResultExecution timeMemory
996133imarnArt Exhibition (JOI18_art)C++14
0 / 100
1 ms344 KiB
#include<bits/stdc++.h> #define ll long long #define pll pair<ll,ll> #define plx pair<ll,int> #define f first #define s second #define pb push_back #define all(x) x.begin(),x.end() using namespace std; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); int n;cin>>n; ll ans=0;pll x[n+1];x[0]={0,0}; for(int i=1;i<=n;i++)cin>>x[i].f>>x[i].s; sort(x+1,x+n+1);for(int i=1;i<=n;i++)x[i].s+=x[i-1].s; int l=1; for(int r=1;r<=n;r++){ ans=max(ans,-x[r].f+x[l].f+x[r].s-x[l-1].s); if(x[r].f-x[r-1].s>x[l].f-x[l-1].s)l=r; }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...