Submission #1229817

#TimeUsernameProblemLanguageResultExecution timeMemory
1229817xxducdatArt Exhibition (JOI18_art)C++20
100 / 100
362 ms12092 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const long long maxN=5*1e5+77; int b[maxN]; signed main(){ int n; cin>>n; vector< pair< int , int > > a(n); for(int i=0;i<n;i++){ cin>>a[i].first>>a[i].second; } sort(a.begin(),a.end()); int res=-1e18,ans=-1e18; for(int i=0;i<n;i++){ b[i]=b[i-1]+a[i].second; res=max(res,a[i].first-b[i-1]); ans=max(ans,res-a[i].first+b[i]); } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...