Submission #1316998

#TimeUsernameProblemLanguageResultExecution timeMemory
1316998djsksbrbfArt Exhibition (JOI18_art)C++20
0 / 100
9 ms15928 KiB
#include <bits/stdc++.h> using namespace std; #define int long long typedef long long ll; typedef pair <ll, ll> pii; #define fi first #define se second #define pb push_back const int MAX = 5e5 + 5; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >>n; vector <pii> v; v.pb({0, 0}); for(int i = 1 ; i <= n ; i++){ int a, b; cin >> a >> b; v.pb({a, b}); } sort(v.begin(), v.end()); ll pref[500005]; pref[0] = 0; for(int i = 1 ; i <= n ; i++)pref[i] = pref[i - 1] + v[i].se; ll prefu[500005], prefd[500005]; for(int i = 0 ; i <= n ; i++){ prefu[i] = prefd[i] = pref[i]; prefu[i] -= v[i].fi; if(i == n)continue; prefd[i] -= v[i + 1].fi; } ll suf[500005]; suf[n + 1] = 0; for(int i = n ; i >= 1 ; i--)suf[i] = max(suf[i + 1], prefu[i]); ll ans = 0; for(int i = 0 ; i <= n ; i++){ ans = max(ans, suf[i + 1] - prefd[i]); } cout << ans << endl; 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...