(파이썬)백준 알고리즘 1966번 프린터 큐

백준 알고리즘 저지 1966번 문제 (https://www.acmicpc.net/problem/1966)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
·¬
for·_·in·range(int(input())):¬
····array_size,·index·=·map(int,·input().split('·'))¬
····que·=·list(map(int,·input().split('·')))¬
····chk·=·[0·for·_·in·range(array_size)]¬
····chk[index]·=·'T'¬
¬
····count·=·0¬
····while·True:¬
········if·que[0]·==·max(que):¬
············count·+=·1¬
············if·chk[0]·==·'T':¬
················print(count)¬
················break¬
············else:¬
················que.pop(0)¬
················chk.pop(0)¬
········else:¬
············que.append(que.pop(0))¬
············chk.append(chk.pop(0))¬
¶
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX