It's easy, if you try

문제링크: https://www.acmicpc.net/problem/1766 풀이 import sys input = sys.stdin.readline import heapq n, m = map(int, input().split()) tree = [[] for _ in range(n+1)] inDegree = [0 for _ in range(n+1)] for _ in range(m): a, b = map(int, input().split()) tree[a].append(b) inDegree[b] += 1 q = [] for i in range(1,n+1): if inDegree[i] == 0: # 차수가 0 인 문제를 최소 힙에 push heapq.heappush(q, i) result = [] while..