제출 #202934

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

using namespace std;

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


    int n;

    vector<pair<long long,long long >> v;

    cin >> n;

    for(int i = 0 ; i < n ; i++)
    {

        long long a , b;

        cin >> a >> b;

        v.push_back({a,b});
    }


    sort(v.begin(),v.end());

    long long s = 0;

    long long aMin = 1e15 , aMax = -1;

    long long best = -1;

    for(int i = 0 ; i < n ; i++)
    {
        s+= v[i].second;

        aMin = min(v[i].first , aMin);

        aMax = max(v[i].first,aMax);

        best = max(best , s - (aMax- aMin));

    }

    cout << best;


    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...