제출 #106978

#제출 시각아이디문제언어결과실행 시간메모리
106978FiloSanzaArt Exhibition (JOI18_art)C++14
100 / 100
339 ms24968 KiB
#include <bits/stdc++.h>

using namespace std;

int main(){
    cin.tie(0);
    cin.sync_with_stdio(0);

    int N;
    cin >> N;
    vector<pair<long long, int>> v(N);

    for(auto &i : v) cin >> i.first >> i.second;
    sort(v.begin(), v.end());

    vector<long long> s(N+1, 0);
    for(int i=1; i<=N; i++) s[i] = s[i-1] + v[i-1].second;

    long long ans = 0, maxi = 0;

    for(int i=0; i<N; i++){
        maxi = max(maxi, v[i].first - s[i]);
        ans = max(ans, s[i+1] - v[i].first + maxi);
    }

    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...