Submission #853314

#TimeUsernameProblemLanguageResultExecution timeMemory
853314thinknoexitArt Exhibition (JOI18_art)C++17
100 / 100
141 ms21296 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; pair<ll, ll> a[500001]; int main() { cin.tie(nullptr)->sync_with_stdio(false); int n; cin >> n; for (int i = 1;i <= n;i++) { cin >> a[i].first >> a[i].second; } sort(a + 1, a + 1 + n); ll ans = LLONG_MIN, mx = LLONG_MIN, now = 0; for (int i = 1;i <= n;i++) { mx = max(mx, -now + a[i].first); now += a[i].second; ans = max(ans, now - a[i].first + mx); } 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...