[Python][프로그래머스][Level4] 선입 선출 스케쥴링

def solution(n, cores):
    if len(cores)>=n:
        return n
    n-=len(cores)
    
    start,end=1,sorted(cores)[-1]*n
    while start<=end:
        middle= (start+end)//2
        num = sum([middle//core for core in cores])
        if num>=n:
            end=middle-1
        else:
            start=middle+1
    
    for idx, core in enumerate(cores):
        n-=(start-1)//core
    
    for idx, core in enumerate(cores):
        if start%core==0:
            n-=1
            if n==0:
                return idx+1