백준 1927번 최소 힙

문제 링크입니다: https://www.acmicpc.net/problem/1927

단순 최소 힙 구현 문제였습니다.

#include <iostream>

#include <queue>

#include <vector>

#include <functional>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int N;

        cin >> N;

 

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

        for (int i = 0; i < N; i++)

        {

                 int num;

                 cin >> num;

 

                 if (!num && pq.empty())

                         cout << 0 << "\n";

                 else if (!num)

                 {

                         cout << pq.top() << "\n";

                         pq.pop();

                 }

                 else

                         pq.push(num);

        }

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~