제출 #936603

#제출 시각아이디문제언어결과실행 시간메모리
936603kitlixArt Exhibition (JOI18_art)C++17
100 / 100
134 ms20824 KiB
#include <bits/stdc++.h>
#define int long long

using namespace std;

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n);
    for (auto& [ai, bi] : a)
        cin >> ai >> bi;
    sort(a.begin(), a.end());
    int mx = 0;
    int cursum = 0;
    int bst = 0;
    for (int i = 0; i < n; ++i) {
        bst = max(bst, a[i].first - cursum);
        mx = max(mx, cursum + a[i].second - a[i].first + bst);
        cursum += a[i].second;
    }
    cout << mx;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...