프로그래머스 - 프로세스

def solution(priorities, location):
    from collections import deque
    q = deque(priorities)
    count = 1
    while q:
        m = max(q)
        temp = q.popleft()
        location -= 1
        if location < 0:
            if temp < m:
                location = len(q)
                q.append(temp)
            else:
                return count
        else:
            if temp < m:
                q.append(temp)
            else:
                count += 1

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