蓝桥杯-小蓝的神奇复印机

"""
https://www.lanqiao.cn/problems/3749/learning/?page=1&first_category_id=1&name=%E5%B0%8F%E8%93%9D%E7%9A%84%E7%A5%9E%E5%A5%87%E5%A4%8D%E5%8D%B0%E6%9C%BA
"""
# 模拟 + 队列 + 优先队列
from queue import Queue, PriorityQueue
N, X = map(int, input().split())
a = list(map(int, input().split()))
q = Queue()
pq = PriorityQueue()
for i, v in enumerate(a):
    q.put((i, v))
    pq.put(-v)
ans = 0
while True:
    # 不断从队列中取元素, 判断是否是当前最重要的
    i, v = q.get()
    if v == -pq.queue[0]:
        pq.get()
        ans += 1
        if i == X:
            print(ans)
            break
    else:
        # 不是当前最重要的任务, 放回队列尾部后面再说
        q.put((i, v))