[프로그래머스] 코딩테스트 연습 > 스택/큐 > 프린터

 

 

def solution(priorities, location):
    answer = 0
    index = [i for i in range(len(priorities))]
    
    max_num = max(priorities)
    while len(priorities) > 0:
        num = priorities.pop(0)
        i = index.pop(0)
        if num != max_num:
            priorities.append(num)
            index.append(i)
        else:
            answer += 1
            if i == location:
                return answer
            max_num = max(priorities)
    return answer