제출 #1267233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267233		codefox	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	320 KiB

art

#include<bits/stdc++.h>

using namespace std;


#define int long long
#define pii pair<int, int>

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //freopen("../input.txt", "r", stdin);
    //freopen("../output.txt", "w", stdout);

    int n;
    cin >> n;
    n++;
    vector<int> pref(n, 0);
    multiset<int> pp;
    vector<pii> ab(n);
    vector<int> a(n);
    vector<int> b(n);
    for (int i = 1; i < n; i++)
    {
        cin >> ab[i].first >> ab[i].second;
    }
    sort(ab.begin(), ab.end());
    for (int i = 1; i < n; i++)
    {
        a[i] = ab[i].first;
        b[i] = ab[i].second; 
    }
    for (int i = 1; i < n; i++)
    {
        pref[i] = pref[i-1]+b[i];
        pp.insert(pref[i]-a[i]);
    }
    pp.insert(pref[n-1]-a[n-1]);
    int ans = 0;
    for (int i= 1; i < n; i++)
    {
        int sol = -pref[i-1]+a[i];
        pp.erase(pp.find(pref[i]-a[i]));
        sol+=*(--pp.end());
        ans = max(ans, sol);
    }
    cout << ans << "\n";

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50