@[QuantumCheshireCat](/user/54591) However,I used to learn C programming language，so I don't know how to use STL at all(except queue)
by 泰山飞狐 @ 2019-11-07 17:17:49
@[泰山飞狐](/user/112972) [priority_queue](https://blog.csdn.net/woshihuangjianwei/article/details/78022521) I guess that you know what it can do.
by Seauy @ 2019-11-07 17:21:30
@[QuantumCheshireCat](/user/54591)
跑题了，还是说人话吧：我就想知道我的手写堆的Prim和Kruskal有什么问题 ？
~~STL大法好！~~
Kruskal我没写什么特殊的，应该能看出来哪儿有问题吧！？
by 泰山飞狐 @ 2019-11-07 17:27:11
@[泰山飞狐](/user/112972) 你的边数开成两倍了……
by Seauy @ 2019-11-07 17:45:05
@[泰山飞狐](/user/112972) 应该是
```cpp
quicksort(1,2*m);
for(i=1;i<=2*m;i++)
{
if(merge(u[i],v[i]))
{
sum+=w[i];
count1++;
}
if(count1==n-1) break;
}
```
by Seauy @ 2019-11-07 17:46:20
@[泰山飞狐](/user/112972) 是吗？好像不对……
by Seauy @ 2019-11-07 17:47:28
不过这可能是你RE的原因……爆数组了
by Seauy @ 2019-11-07 17:48:15