[BOJ] 절대값 힙

#include<iostream>
#include<algorithm>
#include<queue>
#include<functional>
#define ll long long
using namespace std;

// Root is Max Value
//priority_queue<int> pq;
//priority_queue<int,vector<int>,less<int> > pq;

// Root is Min Value
priority_queue<int,vector<int>,greater<int> > _pq;
priority_queue<int,vector<int>,greater<int> > pq;

void print(int i){
    if( i == 1){
        printf("%d\n",pq.top());
        pq.pop();
    }
    else{
        printf("-%d\n",_pq.top());
        _pq.pop();
    }
}

int main(void) {
    int tc;
    cin >> tc;
    
    while (tc--) {
        int a;
        scanf("%d",&a);
        
        if( a==0 ){
            if( pq.empty() && _pq.empty())
                printf("0\n");
            
            else {
                if( pq.empty())
                    print(0);
                else if( _pq.empty())
                    print(1);
                else{
                    if( pq.top() < _pq.top() )
                        print(1);
                    else
                        print(0);
                }
            }
        }
        else{
            if( a < 0 )
                _pq.push( a * -1);
            else
                pq.push(a);
        }
    }
    
    return 0;
}

#include <cstdio>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair <int, int> p;

priority_queue <p, vector<p>, greater<p>> pq;

int main() {
    int n; scanf("%d", &n);
    while (n--) {
        int x; scanf("%d", &x);
        if (x) pq.push(p{ abs(x), x });
        else {
            if (pq.empty()) printf("0\n");
            else {
                printf("%d\n", pq.top().second);
                pq.pop();
            }
        }
    }
    return 0;
}