Submission #591002

#TimeUsernameProblemLanguageResultExecution timeMemory
591002piOOEArt Exhibition (JOI18_art)C++17
100 / 100
202 ms20692 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<pair<ll, ll>> p(n); for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second; sort(p.begin(), p.end()); ll mn = 0, S = 0, ans = 0; for (int i = 0; i < n; ++i) { auto [a, b] = p[i]; mn = min(mn, S - a); S += b; ans = max(ans, S - mn - a); } 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...