[백준 17835번] 면접보는 승범이네 (Python3)
import sys input = sys.stdin.readline from heapq import * N,M,K = map(int,input().split()) graph = [[] for i in range(N+1)] for _ in range(M): a,b,w = map(int,input().split()) graph[b].append((a,w)) data = [*map(int,input().split())] check = [0]*(N+1); hq = [] for a in data: check[a] = 1 for b,w in graph[a]: heappush(hq,(w,-b)) now,w = -1,0 for _ in range(N-K): while 1: w,now = heappop(hq) if ch..
