42587번: 프린터

programmers.co.kr/learn/courses/30/lessons/42587

코딩테스트 연습 - 프린터

from collections import deque


def solution(priorities, location):
    # queue: [(2, 0), (1, 1), (3, 2), (2, 3)]
    queue = deque((p, i) for i, p in enumerate(priorities))
    print(queue)

    cnt = 0
    while queue:
        cp, ci = queue.popleft()
        if any(cp < p for p, i in queue):  # 최우선순위가 아니라면
            queue.append((cp, ci))
        else:
            cnt += 1
            if ci == location:
                return cnt


res = solution([2, 1, 3, 2], 2)
print(res)