노트

import sys import heapq input = sys.stdin.readline V, E = map(int, input().split()) visited = [False]*(V+1) Elist = [[] for _ in range(V+1)] heap = [[0, 1]] for _ in range(E): s, e, w = map(int, input().split()) Elist[s].append([w, e]) Elist[e].append([w, s]) answer = 0 cnt = 0 while heap: if cnt == V: break w, s = heapq.heappop(heap) if not visited[s]: visited[s] = True answer += w cnt += 1 for..