Submission #621489

#TimeUsernameProblemLanguageResultExecution timeMemory
621489elkernosArt Exhibition (JOI18_art)C++17
100 / 100
218 ms20948 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define x first #define y second int32_t main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<pair<int, int>> p(n + 1); for(int i = 1; i <= n; i++) { cin >> p[i].x >> p[i].y; } sort(p.begin() + 1, p.end()); const int oo = 1e18; int pref = 0, maxi = -oo, ans = -oo; for(int i = 1; i <= n; ++i) { pref += p[i].y; ans = max({ans, pref + maxi - p[i].x, p[i].y}); maxi = max(maxi, p[i].x - (pref - p[i].y)); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...