코드 # 크루스칼 알고리즘 import sys input = sys.stdin.readline def find(x, lst): if x != lst[x]: lst[x] = find(lst[x], lst) return lst[x] def union(a,b,lst): a = find(a, lst) b = find(b, lst) if a < b: lst[b] = a else: lst[a] = b n,m = map(int, input().split()) parent = [i for i in range(n+1)] edge = [] for _ in range(m): a,b,c = map(int, input().split()) edge.append((c,a,b)) edge.sort(key=lambda x: x[0])..
