1927 최소 힙

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    priority_queue<int, vector<int>, greater<>> pq;
    // greater<> << 작은 노드가 top이 됨
    // less<> << 큰 노드가 top이 됨

    int node[] = {5, 9, 11, 14, 18, 19, 21, 33, 17, 27};

    for (int i = 0; i < 10; i++)
    {
        pq.push(node[i]);
    }

    cout << pq.top() << "\\n";
    pq.pop();
    cout << pq.top() << "\\n";
    return 0;
}

11279 최대 힙

#include <bits/stdc++.h>
using namespace std;

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

    int n;
    cin >> n;

    priority_queue<int, vector<int>, less<>> pq;

    for (int i = 0; i < n; i++)
    {
        int x;
        cin >> x;
        if (x == 0)
        {
            if (pq.empty())
            {
                cout << "0\\n";
            }
            else
            {
                cout << pq.top() << "\\n";
                pq.pop();
            }
        }
        else
        {
            pq.push(x);
        }
    }

    return 0;
}