Submission #925530

#TimeUsernameProblemLanguageResultExecution timeMemory
925530VMaksimoski008Art Exhibition (JOI18_art)C++14
100 / 100
468 ms48468 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<pair<ll, ll> > v(n+1); for(int i=1; i<=n; i++) cin >> v[i].first >> v[i].second; sort(v.begin()+1, v.end()); ll ans = 0; vector<ll> pref(n+1); set<ll> s; for(int i=1; i<=n; i++) { pref[i] = pref[i-1] + v[i].second; s.insert(v[i].first - pref[i-1]); ans = max(ans, pref[i] - v[i].first + *s.rbegin()); } cout << ans << '\n'; 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...