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

프로세스

프로그래머스

 

from collections import deque
def solution(priorities, location):
    q = deque(enumerate(priorities))
    exit_number = 0
    while q:
        max_priority = max(a for _, a in q) if q else 0
        idx, priority = q.popleft()
        if priority < max_priority:
            q.append([idx, priority])
        else:
            exit_number += 1
            if idx == location:
                return exit_number

 

백준: 프린터 큐