제출 #1054566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054566		unnick	Safety (NOI18_safety)	C++14	100 / 100	59 ms	5492 KiB

safety

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

typedef long long int ll;

int main() {
    int n, h;
    cin >> n >> h;
    
    priority_queue<ll> lq;
    priority_queue<ll, vector<ll>, greater<ll> > hq;
    ll off = 0;

    ll val = 0;

    for (int i = 0; i < n; i++) {
        int e;
        cin >> e;
        if (i > 0) off += h;
        else {
            hq.push(e);
            lq.push(e);
            continue;
        }
        ll cut = lq.top() - off;
        if (e <= cut) {
            val += cut - e;
            lq.push(e+off);
            lq.push(e+off);
            hq.push(lq.top() - off - off);
            lq.pop();
        } else {
            if (e > hq.top() + off) val -= hq.top() + off - e;
            hq.push(e-off);
            hq.push(e-off);
            lq.push(hq.top() + off + off);
            hq.pop();
        }
    }

    cout << val << "\n";
}

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 9 / 9
• Subtask 4: 5 / 5
• Subtask 5: 6 / 6
• Subtask 6: 11 / 11
• Subtask 7: 11 / 11
• Subtask 8: 22 / 22
• Subtask 9: 29 / 29