1966번: 프린터큐 (구현, 큐) - Fastcampus

www.acmicpc.net/problem/1966

1966번: 프린터 큐

from collections import deque


def run(N, M, a):
    qu = deque([(p, i) for i, p in enumerate(a)])  # 큐

    cnt = 0
    while qu:
        cp, ci = qu.popleft()
        if all(cp >= p for p, i in qu):  # 중요도가 최대값이면 출력
            cnt += 1
            if ci == M:
                return cnt
        else:
            qu.append((cp, ci))


T = int(input())
for _ in range(T):
    N, M = map(int, input().split())
    a = list(map(int, input().split()))
    print(run(N, M, a))