[프로그래머스 코딩테스트 고득점 kit] 프린터

def solution(priorities, location):
    answer = 0
    
    while len(priorities) != 0:
        if priorities[0] == max(priorities):
            answer += 1
            priorities.pop(0)
            if location == 0:
                return answer
            else:
                location -= 1
        else:
            priorities.append(priorities.pop(0))
            if location == 0:
                location = len(priorities) - 1
            else:
                location -= 1
    
    return answer