Submission #1026233

#TimeUsernameProblemLanguageResultExecution timeMemory
1026233vaneaArt Exhibition (JOI18_art)C++17
100 / 100
152 ms25016 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()); ll prev = v[n][1] - v[n][0], ans = v[n][1]; for(int i = n-1; i > 0; i--) { ll curr = prev+v[i][1]; ll k = v[i][1]-v[i][0]; if(curr > k) { prev = curr; ans = max(ans, curr + v[i][0]); } else { prev = k; ans = max(ans, k + v[i][0]); } } 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...