```cpp
for (int i = 1; i <= m; i ++){
int qx = que(e[i].u);
int qy = que(e[i].v);
if (qx == qy) continue;
fa[qx] = qy;
cnt ++, sum += e[i].w;
}
if (cnt < n) puts("orz");
else printf("%lld", sum);
```
这样子会舒服一点
by Missdie @ 2023-10-26 14:20:29
check函数写错了
找两个点的祖先是否相同，而非他们父亲
by cy1999_de_dog @ 2023-10-26 14:35:52
@[cy1999_de_dog](/user/442801) 谢谢您！通过了！
by Lance1_1 @ 2023-10-26 16:04:25
@[Missdie](/user/995040) 好的，谢谢您！
by Lance1_1 @ 2023-10-26 16:05:05