Submission #1026235

#TimeUsernameProblemLanguageResultExecution timeMemory
1026235vaneaArt Exhibition (JOI18_art)C++14
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const ll NINF = -1e18; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<array<ll, 2>> v(n+1); vector<ll> pref(n+1); for(int i = 1; i <= n; i++) { cin >> v[i][0] >> v[i][1]; } sort(v.begin(), v.end()); for(int i = 1; i <= n; i++) { pref[i] = v[i][1] + pref[i-1]; } ll ans = pref[1]; ll mx = 0; for(int i = 2; i <= n; i++) { ans = max(ans, v[i][1]); ll curr = pref[i] - v[i][0]; curr += mx; ans = max(ans, curr); mx = max(mx, v[i][0] - pref[i-1]); } 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...