/ ALGORITHM

프로그래머스 - 프린터

image-20230125150923666

from collections import deque

def solution(priorities, location):
    answer = []
    
    printlist = []
    for x,y in enumerate(priorities):
        printlist.append([x,y])
    
    queue = deque(printlist)
    while queue:
        idx,front = queue.popleft()
        printed = True
        for i in queue:
            if i[1]>front:
                queue.append([idx,front])
                printed=False
                break
                
        if printed==True:
            answer.append(idx)
                
    return answer.index(location)+1