제출 #1205338

#제출 시각아이디문제언어결과실행 시간메모리
1205338toast12Art Exhibition (JOI18_art)C++20
100 / 100
360 ms8316 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<pair<ll, ll>> v(n); for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); ll ans = v[0].second, cur = v[0].second; for (int i = 1; i < n; i++) { cur = max(v[i].second, cur+v[i-1].first-v[i].first+v[i].second); ans = max(ans, cur); } 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...