```
for(int i=1;i<=n;i++){
if(find(a[i].l)==find(a[i].r)) continue;
ans+=a[i].num;
merge(a[i].l,a[i].r);
cnt++;
if(cnt==n-1) break;
}
```
这个循环改成到m，然后判断图不联通就好了
by Infinity_Fantasy @ 2023-10-19 13:50:52
@[c_y_y](/user/777965)
by Infinity_Fantasy @ 2023-10-19 20:13:46