import sys,heapqinput=sys.stdin.readlinedef dijkstra(start): hq=[] heapq.heappush(hq,(0,start)) # heapq는 첫번째 요소를 기준으로 최솟값 꺼냄!!! dist[start]=0 while hq: d,u=heapq.heappop(hq) if dist[u]nw: dist[v]=nw heapq.heappush(hq,(nw,v))#1.입력V,E=map(int,input().split())start=int(input())#2.자료형 정의INF=float('inf')edges=[[] for _ in range(V+1)]dist=[INF fo..