그랬었습니다

https://programmers.co.kr/learn/courses/30/lessons/42891 코딩테스트 연습 - 무지의 먹방 라이브 programmers.co.kr 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 import heapq def solution(food_times, k): q = list() size = len(food_times) for i in range(size): heapq.heappush(q, (food_times[i], i + 1)) previous = 0 while q: time, num = heapq.heappop(q) time_sum = size * (time - previous) if k ..