python用队列怎么会超时啊

n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
h,t=0,-1
for i in range(n):
    while h<=t and a[i]<=a[b[t]]:
        t-=1
    t+=1
    b[t]=i
    if b[h]<i-k+1:
        h+=1
    if i>=k-1:
        print(a[b[h]],end=' ')
print()
h,t=0,-1
for i in range(n):
    while h<=t and a[i]>=a[b[t]]:
        t-=1
    t+=1
    b[t]=i
    if b[h]<i-k+1:
        h+=1
    if i>=k-1:
        print(a[b[h]],end=' ')