문제 풀이from collections import deque#큐를 순회하여 최대 우선순위 찾는 함수def max_queue(queue) : max = float('-inf') #queue 순회 for i, (_, priority) in enumerate(queue) : if priority > max : max = priority return maxdef solution(priorities, location): # location(key) : priorities(value)값을 가지는 딕셔너리 생성 priorities_dict = {index : value for index, value in enumerate(priorities)..