[백준 알고리즘] 1966번 프린터 큐 (Python)

<Python>

import collections
import sys

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

for _ in range(test):
    cnt = 0
    n, m = map(int, sys.stdin.readline().split())
    priority = collections.deque(map(int, sys.stdin.readline().split()))

    if len(priority) == 1:
        print(1)
    else:
        while True:
            index = priority.index(max(priority))
            for _ in range(index):
                a = priority.popleft()
                priority.append(a)
                if m >= 1:
                    m -= 1
                else:
                    m = len(priority) - 1
            priority.popleft()
            cnt += 1
            if m == 0: break  # m우선순위가 높은 것이 더이상 없으면서 m==0이 되었을때
            m -= 1
        print(cnt)

 

▼링크

https://www.acmicpc.net/problem/1966

1966번: 프린터 큐