HDU1285（拓扑排序裸题

。。被多组测试坑了一波

 #include<iostream>
 #include<vector>
 #include<queue>
 using namespace std;
 typedef long long ll;
 const int N = 1e3;
 vector<int>edge[N];
 vector<int> ans;
 priority_queue<int, vector<int>, greater<int> >q;
 int n,m,l,r,in[N];
 int main(){
     ios::sync_with_stdio();
     while(cin>>n>>m){

     ans.clear();while(!q.empty())q.pop();
     for(int i = ;i <= n;++i){in[i] = ;edge[i].clear();}

     for(int i = ;i <= m;++i){
         cin>>l>>r;
         edge[l].push_back(r);in[r]++;
     }
     for(int i = ;i <= n;++i)if(in[i]==)q.push(i);
     while(!q.empty()){
         int p = q.top();q.pop();
         ans.push_back(p);
         for(int i = ; i < edge[p].size();++i){
             int y = edge[p][i];in[y]--;
             if(!in[y])q.push(y);
         }
     }
     for(int i = ;i < n;++i){
         if(i!=n-)cout<<ans[i]<<" ";
         else cout<<ans[i]<<endl;
     }
     }
     return ;
 }