Submission #1026255

#TimeUsernameProblemLanguageResultExecution timeMemory
1026255vaneaArt Exhibition (JOI18_art)C++14
100 / 100
131 ms12376 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 ans = 0, acc = 0, lo = 0; for(int i = 1; i <= n; i++) { lo = max(lo, -acc+v[i][0]); acc += v[i][1]; ans = max(ans, acc - v[i][0] + lo); } 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...