백준 11279: 최대 힙

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

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

	int N, i, tmp;
	priority_queue<int> pq;

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