힙 - 디스크 컨트롤러 / 파이썬

import heapq

def solution(jobs):
    answer, cnt, last = 0, 0, -1
    heap = []
    jobs.sort()
    time = jobs[0][0]
    while cnt < len(jobs):
        for s, t in jobs:
            if last < s <= time:
                heapq.heappush(heap, (t, s))
        if heap:
            term, start = heapq.heappop(heap)
            last = time
            time += term
            answer += (time - start)
            cnt += 1
        else:
            time += 1
    return answer // len(jobs)

 

 

programmers.co.kr/learn/courses/30/lessons/42627#

코딩테스트 연습 - 디스크 컨트롤러