1927번: 최소 힙

#include<cstdio>

#include<queue>

#include<functional>

using namespace std;

int main()

{

priority_queue<int, vector<int>, greater<int> > num;

int n, x;

scanf("%d", &n);

while (n--)

{

scanf("%d", &x);

if (x == 0)

if (num.empty())

printf("%d\n", 0);

else

{

printf("%d\n", num.top());

num.pop();

}

else

num.push(x);

}

}