Submission #234291

#TimeUsernameProblemLanguageResultExecution timeMemory
234291Toirov_SadiArt Exhibition (JOI18_art)C++17
100 / 100
810 ms25004 KiB
#include<bits/stdc++.h>

using namespace std;

int n;
vector<long long> p;
vector<pair<long long, int>> a;
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++){
        int y;
        long long x;
        cin >> x >> y;
        a.push_back({x, y});
    }
    sort(a.begin(), a.end());

    p.resize(n, 0ll);
    for(int i = 0; i < n; i ++){
        if(i > 0) p[i] = p[i - 1];
        p[i] += a[i].second;
    }

    long long mx = 0;
    long long mn = LONG_MAX;

    for(int i = 0; i < n; i ++){
        mn = min(mn, (i == 0 ? 0 : p[i - 1]) - a[i].first);

        mx = max(mx, p[i] - a[i].first - mn);
    }

    cout << mx << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...