[백준 17612번-파이썬] 쇼핑몰

http://acmicpc.net/problem/17612 {코드} import heapq import sys input = sys.stdin.readline n, k = map(int, input().split()) cus = [] items = [] for _ in range(n): customer, item_cnt = map(int, input().split()) cus.append(customer) items.append(item_cnt) counter = [] for i in range(k): heapq.heappush(counter, (0, i)) time_needed = [0] * k finished = [] for i in range(n): t, x = heapq.heappop(counte..