[백준] 11286 - 절댓값 힙(설명X)

#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
 
class AbsHeap {
private:
    int num;
public:
    AbsHeap(int num) : num(num) {};
    int getNum() {
        return this->num;
    }
};
 
bool operator>(AbsHeap h1, AbsHeap h2) {
    if (abs(h1.getNum()) == abs(h2.getNum()))
        return h1.getNum() > h2.getNum();
    else
        return abs(h1.getNum()) > abs(h2.getNum());
}
 
int main() {
    int N;
    scanf("%d", &N);
    priority_queue<AbsHeap, vector<AbsHeap>, greater<AbsHeap>> pqueue;
    for (int i = 0; i < N; i++) {
        int x;
        scanf("%d", &x);
        if (x != 0)
            pqueue.push(AbsHeap(x));
        else if (pqueue.size() > 0) {
            AbsHeap h = pqueue.top();
            pqueue.pop();
            printf("%d\n", h.getNum());
        }
        else
            printf("0\n");
    }
}