Programmers 프린터

from collections import deque


def solution(priorities, location):
    queue = deque([(b, a) for a, b in enumerate(priorities)])

    answer = 1
    while queue:
        if queue[0][0] == max(queue)[0]:
            if queue[0][1] == location:
                return answer
            queue.popleft()
            answer += 1
        else:
            queue.append(queue.popleft())
    return answer

def solution(priorities, location):
    queue =  [(i,p) for i,p in enumerate(priorities)]
    answer = 0
    while True:
        cur = queue.pop(0)
        if any(cur[1] < q[1] for q in queue):
            queue.append(cur)
        else:
            answer += 1
            if cur[0] == location:
                return answer