조예지

from collections import deque def solution(priorities, location): queue = deque() for idx, val in enumerate(priorities): queue.append((val, idx)) cnt = 0 while True: now = queue.popleft() if now[0] == max(priorities): cnt += 1 priorities[now[1]] = 0 if now[1] == location: break else: queue.append(now) return cnt