[C/C++ 백준 1927번] 최소 힙 (Silver 1)

www.acmicpc.net/problem/1927

1927번: 최소 힙

greater <int> 이용

#include <cstdio>
#include <queue>
using namespace std;
int main(void){
	priority_queue <int, vector<int>, greater<int>> q;
	int N, x;
	scanf("%d", &N);
	for(int i=0; i<N; i++){
		scanf("%d", &x);
		if(x==0){
			if(q.empty())
				printf("0\n");
			else{
				printf("%d\n", q.top());
				q.pop();
			}
		}
		else
			q.push(x);
	}
}

사용자 지정 함수 이용

#include <cstdio>
#include <queue>
using namespace std;
class Comp{
	public:
		bool operator()(const int &a, const int &b){
			return a>b;
		}
};
int main(void){
	priority_queue <int, vector<int>, Comp> q;
	int N, x;
	scanf("%d", &N);
	for(int i=0; i<N; i++){
		scanf("%d", &x);
		if(x==0){
			if(q.empty())
				printf("0\n");
			else{
				printf("%d\n", q.top());
				q.pop();
			}
		}
		else
			q.push(x);
	}
}