# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984653 | 2024-05-17T00:40:19 Z | aaaaaarroz | Art Exhibition (JOI18_art) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int n; cin>>n; vector<pair<ll, ll>> v; for (int i = 0; i < n; i++) { ll a, b; cin>>a>>b: v.push_back(make_pair(a, b)); } sort(v.begin(), v.end()); ll score = v[0].second; ll best_score = score; for (int i = 1; i < n; i++) { ll dist = v[i].first - v[i-1].first; ll diff = v[i].second - dist; if (score+diff > v[i].second) { score += diff; } else { score = v[i].second; } if (score > best_score) { best_score = score; } } cout<<best_score<<"\n"; return 0; }