코드 import sys, heapq input = sys.stdin.readline INF = 987654321 n = int(input()) m = int(input()) graph = [[] for _ in range(n+1)] visited = [INF]*(n+1) # 방문 기록을 위해 1차원 배열 생성 for _ in range(m): x,y,z = map(int, input().split()) graph[x].append((y,z)) startpoint, dist = map(int, input().split()) def dijkstra(start): q = [(0, start)] visited[start] = 0 while q: popstart, popdist = heapq.heappop(q)..
