[백준] 11279 - 최대 힙(설명X)

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
 
int main() {
    priority_queue<int> p_queue;
    int N;
    scanf("%d", &N);
 
    for (int i = 0; i < N; i++) {
        int num;
        scanf("%d", &num);
 
        switch (num)
        {
        case 0:
            if (p_queue.size() == 0)
                printf("0\n");
            else {
                printf("%d\n", p_queue.top());
                p_queue.pop();
            }
            break;
        default:
            p_queue.push(num);
            break;
        }
    }
    return 0;
}