dtwd886的博客

拓扑排序+优先队列 #include #include #include #include #include using namespace std; #define maxn 1<<29 int N,M; int degree[100010]; int flag[100010]; vectormapp[100010]; int main() { int T,i,a,b;

#include #include #include #include using namespace std; struct node { char name[1000]; int num; int value; int id; bool friend operator<(node x,node y) { if(x.value!=y.value) return x.

#include #include #include #include using namespace std; struct node { int value; bool friend operator<(node x,node y) { return x.value>y.value; } }; int num[30]; int main() { int n,m,