Q11286.cpp

#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

struct Compare {
    bool operator()(int a, int b) {
        if (abs(a) == abs(b))
            return a > b;  // 작은 값이 먼저 나오게 (minHeap)
        return abs(a) > abs(b);  // 절댓값 작은 게 먼저
    }
};


int main(){

    cin.tie(0);
    ios::sync_with_stdio(0);
    int t;
    cin>>t;
    int n;
    priority_queue<int, vector<int>, Compare> minHeap;

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

    }
    

}