[백준 / Python] 네트워크 연결_1922
내 풀이 n = int(input()) m = int(input()) parent = [i for i in range(n + 1)] def find(parent, x): if parent[x] != x: parent[x] = find(parent, parent[x]) return parent[x] def union(parent, a, b): a = find(parent, a) b = find(parent, b) if a b: parent[a] = b data = [] for _ in range(m): a, b, c = map(int, input().split()) data.append((c, a, b)) data.sort() def solved(): result = 0 for i in data: cost..