[C++] priority queue 사용법

	#include <cstdio>
	#include <vector>
	#include <queue>
	using namespace std;
	vector<vector<int>> adj;
	vector<int> cnt;
	int N,M;
	void bfs(){
	priority_queue<int, vector<int>,greater<int>> q;
	for (int i=1;i<=N;i++){
	if (cnt[i] == 0)
	{
	q.push(i);
	}
	}
	while (!q.empty()){
	int now = q.top();
	printf("%d ",now);
	q.pop();
	for (int i=0;i<adj[now].size();i++){
	int next = adj[now][i];
	cnt[next]--;
	if (cnt[next] == 0)
	{
	q.push(next);
	}
	}
	}
	}
	int main(void){
	scanf("%d %d",&N,&M);
	adj.resize(N+1);
	cnt.resize(N+1);
	for (int i=1;i<=N;i++){
	cnt[i] = 0;
	}
	for (int i=0;i<M;i++){
	int a,b;
	scanf("%d %d",&a,&b);
	adj[a].push_back(b);
	cnt[b]++;
	}
	bfs();
	}

view raw [c++]priority queue 사용법 hosted with ❤ by GitHub