【hdu1285】【拓扑排序】 确定比赛名次

#include <bits/stdc++.h>
#define mst(ss,b) memset(ss,b,sizeof(ss));
#define rep(i,k,n) for(int i=k;i<=n;i++)
using  namespace  std;

const int N=510;

std::vector<int> g[N];
int deg[N];//入度
int n, m;
priority_queue<int, vector<int>, greater<int> > q;

void topo(){
	rep(i, 1, n){
		if(deg[i] == 0)q.push(i);
	}

	int tol = 1;
	while(!q.empty()){
		int u = q.top();
		q.pop();
		if(tol != n){
			cout<<u<<' ';
			tol++;
		}
		else cout<<u<<endl;
		for(auto v : g[u]){
			deg[v] --;
			if(!deg[v])q.push(v);
		}
	}
}

int  main(){
	while(cin>>n>>m){
		mst(deg, 0);
		rep(i, 1, n)g[i].clear(); //不能忘了
		rep(i, 1, m){
			int u,v;
			cin>>u>>v;
			g[u].push_back(v);
			deg[v]++;
		}
		topo();
	}
  return 0;
}