[백준] 1966번: 프린트 큐

😎BACKJOON>1966번: 프린트 큐

📘 문제풀이

import sys
from collections import deque

k = int(sys.stdin.readline())

for _ in range(k):
    n, m = map(int, sys.stdin.readline().split())
    arr = list(map(int, sys.stdin.readline().split()))
    queue1 = deque(arr)
    queue2 = deque(range(len(arr)))
    answer = []
    
    while queue1:
        mq = max(queue1)
        p1 = queue1.popleft()
        p2 = queue2.popleft()        
        if p1 == mq:
            answer.append(p2)
        else:
            queue1.append(p1)
            queue2.append(p2)
    
    print(answer.index(m)+1)