백준 1927번 - C++

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


int n,m;

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	priority_queue<int, vector<int>, greater<int>> pq;

	while (n--) {
		cin >> m;
		if (m > 0) {
			pq.push(m);
		}
		else {
			if (pq.empty()) cout << 0 << '\n';
			else {
				cout << pq.top() << '\n';
				pq.pop();
			}
		}
	}
}