Submission #1108392

#TimeUsernameProblemLanguageResultExecution timeMemory
1108392vjudge1Art Exhibition (JOI18_art)C++17
100 / 100
132 ms14528 KiB
#include <bits/stdc++.h>
#define task ""
#define ll long long
#define N 500010
#define pii pair<ll, ll>

using namespace std;
pii a[N];
int n;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    freopen(task".inp", "r", stdin);
//    freopen(task".out", "w", stdout);

    cin >> n;
    ll res = 0;
    for (int i = 1; i <= n; i++)
        cin >> a[i].first >> a[i].second;
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++)
        a[i].second += a[i - 1].second;
    priority_queue<ll> pQ;
    for (int i = 1; i <= n; i++)
    {
        pQ.push(a[i].first - a[i - 1].second);
        res = max(res, a[i].second - a[i].first + pQ.top());
    }
    cout << res;
    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...