Submission #127333

#TimeUsernameProblemLanguageResultExecution timeMemory
127333shuvi_dolaArt Exhibition (JOI18_art)C++14
100 / 100
254 ms17528 KiB
#include <bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; const int N = 5e5+3; int c[N], best[N], n, k; pair <int,int> pic[N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cin>>n; for(int i=1;i<=n;i++) { cin>>pic[i].fi>>pic[i].se; } sort(pic+1,pic+1+n); c[1] = pic[1].se; for(int i=2;i<=n;i++) { c[i] = pic[i].se - (pic[i].fi - pic[i-1].fi); } int ans = 0; for(int i=1;i<=n;i++) { best[i] = max(best[i-1] + c[i], pic[i].se); ans = max(ans, best[i]); } 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...