HDU-1285 确定比赛名次 拓扑排序

输出最小的注意一下，代码如下，水题不解释

#include<iostream> 
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack> 
#define MM(a) memset(a,0,sizeof(a));
using namespace std;
const int maxn=510;
vector<int>grid[maxn];
int indu[maxn];
/*
7 7
1 7
2 5
3 5
4 1
4 2
6 3
6 4
*/
void find(int N){
	priority_queue<int,vector<int>,greater<int> >Q;
	for(int i=1;i<=N;i++)if(indu[i]==0)Q.push(i);
	vector<int>ans;
	while(!Q.empty()){
		int now=Q.top();Q.pop();
		//printf("-%d-\n",now);
		ans.push_back(now);
		for(int i=0;i<grid[now].size();i++){
			int next=grid[now][i];
			if(--indu[next]==0)Q.push(next);
		}
	}
	for(int i=0;i<ans.size();i++){
		printf("%d",ans[i]);
		if(i==ans.size()-1)printf("\n");
		else printf(" ");
	}
}
int main(){
	int N,M;
	while(scanf("%d%d",&N,&M)==2 &&N){
		for(int i=1;i<=N;i++)grid[i].clear();
		MM(indu);
		for(int i=0;i<M;i++){
			int p1,p2;
			scanf("%d%d",&p1,&p2);
			grid[p1].push_back(p2);//p2输给p1
			indu[p2]++;
		}
		find(N);
	}
	return 0;
}