[BOJ] 최대 힙

#include<iostream>
#include<queue>
using namespace std;

// Root is Max Value
priority_queue<int> pq;
//priority_queue<int,vector<int>,less<int> > pq;

int main(void) {
    int tc;
    cin >> tc;
    
    while (tc--) {
        int a;
        scanf("%d",&a);
        
        if( a==0 ){
            if( pq.empty() ){
                printf("0\n");
            }
            else{
                printf("%d\n",pq.top());
                pq.pop();
            }
        }
        else{
            pq.push(a);
        }
    }
    
    return 0;
}