(SWEA c++)2930. 힙

swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV-Tj7ya3jYDFAXr&categoryId=AV-Tj7ya3jYDFAXr&categoryType=CODE

SW Expert Academy

C++ STL의 priority_queue를 이용하면 쉽게 해결 가능..!

#include <iostream>
#include <queue>

using namespace std;

int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    
    for(int tc = 1; tc <= t; tc++)
    {
        int num, cmd;
        priority_queue<int> pq;
    
        cin >> num;
        cout << "#" << tc;
        
        for(int i = 0; i < num; i++)
        {
            cin >> cmd;
            if(cmd == 1)
            {
                int n;
                cin >> n;
                pq.push(n);
            }
            else
            {
                if(pq.empty())
                    cout << " -1";
                else
                {
                    cout << " " << pq.top();
                    pq.pop();
                }
            }
        }
        cout << endl;
    }
        
    return 0;
}