[프로그래머스] 프로세스

😎코딩테스트 연습>스택/큐>프로세스

from collections import deque

def solution(priorities, location):
    answer = 0 
    seq = []
    queue = [(i, idx) for idx, i in enumerate(priorities)]
    
    while queue:
        m  = max(queue, key=lambda x: x[0])
        p, i = queue.pop(0)     
        if m[0] > p:
            queue.append((p, i))
        else:
            seq.append(i)

    answer = seq.index(location) + 1
    return answer