🔗링크 : https://www.acmicpc.net/problem/1062🗒️파이썬 코드 풀이from heapq import heappop,heappushN = int(input())M = int(input())lst = [[] for _ in range(N+1)]for _ in range(M): start,end,cost = map(int,input().split()) lst[start].append((end,cost))departure, arrival = map(int,input().split())distance = [float('INF')] * (N+1)distance[departure] = 0queue = [(0,departure)]while queue : current_cost,cu..
