제출 #112266

#제출 시각아이디문제언어결과실행 시간메모리
112266dolphingarlicArt Exhibition (JOI18_art)C++11
100 / 100
615 ms21124 KiB
#include <bits/stdc++.h>
using namespace std;
int n;
pair<long long, int> a[500002];
int main() {
    cin >> n;
    long long ans = 0, mx = 0;
    for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second;
    sort(a, a + n);
    for (int i = 0; i < n; ++i) {
        auto x = a[i].first;
        auto y = a[i].second;
        long long r = mx + y - x;
        r = max(r, 1ll * y);
        ans = max(ans, r);
        mx = max(mx, r + x);
    }
    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...