[프로그래머스 | 스택/큐] 프린터 - Python

def solution(priorities, location):
    
    from collections import deque
    
    works = deque([ i for i in range(len(priorities))])
    priorities = deque(priorities)
    works_done = deque()
    
    while location not in works_done:
        if priorities[0] != max(priorities):
            priorities.append(priorities.popleft())
            works.append(works.popleft())
        else:
            priorities.popleft()
            works_done.append(works.popleft())
        
    answer = len(works_done)
    
    return answer

문제 그대로 구현
괜히 가독성 높힌답시고 설치다가 priorities.popleft() 한줄 빼먹어서 30분을 헤맸다 ㅜㅜ