[프로그래머스] 디스크 컨트롤러

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

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

 

import heapq
def solution(jobs):
    answer=0
    time=0
    last_start=-1
    count=0
    q=[]
    jobs.sort()

    while count<len(jobs):
        for i in range(len(jobs)):
            if last_start<jobs[i][0]<=time:
                heapq.heappush(q, [jobs[i][1], jobs[i][0]])
        if len(q)>0:
            count+=1
            now = heapq.heappop(q)
            last_start=time
            time+=now[0]
            answer+=(time-now[1])
        else:
            time+=1

    return int(answer//len(jobs))