摘要： 一道简单的拓扑排序，因为优先选小的所以用了优先队列#include#include#include#include#includeusing namespace std;vector eg[505];int ans[505], ct[505];struct Node{ bool operator b.va; } int va; Node(){} Node(int x){va=x;}} ;priority_queueq;int main(){ int i, j, n, m, now, a, b; while(scanf("%d%d",&n,&m)!=EO... 阅读全文