Daily Study Logging4.3 - 프로그래머스 디스크 컨트롤, 파이썬

def solution(jobs):
    jobs.sort(key = lambda x: x[1])
    curT = 0
    ansset = [] 
    while jobs:
        isNotIn = True
        for i in range(len(jobs)):
            if jobs[i][0] <= curT:
                excution = jobs.pop(i)
                isNotIn = False
                break
        if isNotIn:
            curT += 1 
            
        else:
            curT += excution[1]
            ansset.append(curT-excution[0])
    answer = sum(ansset)//len(ansset)
    return answer
print(solution([[0, 3], [1, 9], [2, 6]]))