프로그래머스 디스크 컨트롤 파이썬(PYTHON)

문제링크 : programmers.co.kr/learn/courses/30/lessons/42627

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

 

import heapq as hq

def solution(jobs):
    lens=len(jobs)
    answer = 0
    heap = list()
    jobs.sort()
    hq.heappush(heap,jobs.pop(0))
    first = hq.heappop(heap)
    time = first[0]+first[1]
    answer = first[1]
    lasttime=first[0]+first[1]
    deleteindex=list()
    
    while True:
        if jobs:
            for i in range(len(jobs)):
                if jobs[i][0] <= time:
                    hq.heappush(heap,[jobs[i][1],jobs[i][0]])
                    deleteindex.append([jobs[i][1],jobs[i][0]])
                else:
                    break
        for i in deleteindex:
            jobs.pop(jobs.index([i[1],i[0]]))
        deleteindex=list()
        if len(heap)==0:
            time+=1
        else:
            if  lasttime==time:
                temp = hq.heappop(heap)
                answer+=time-temp[1]+temp[0]
                time+=temp[0]
                lasttime=time
            elif lasttime !=time:
                temp = hq.heappop(heap)
                answer+=temp[0]
                time+=temp[0]
                lasttime=time
        if len(jobs)==0 and len(heap)==0:
            break
    x,y = divmod(answer,lens)
    return x