求助SOS，90分，第三个点WA了

#include<bits/stdc++.h>
using namespace std;
struct note{
    int s,id;
};
const int maxn=1000000+5;
int n,k,i,j,ys,mi[maxn],ma[maxn];
note qmin[maxn];
note qmax[maxn];
int main(){
    cin>>n>>k;
    int head=1,tail=0,head2=1,tail2=0,z=0,z2=0;
    for(i=1;i<=n;i++){
        scanf("%d",&ys);
        if(i-qmin[head].id>=k){
            head++;
        }
        while(qmin[tail].s>=ys && tail-head>=0){
            tail--;
        }
        qmin[++tail].s=ys;
        qmin[tail].id=i;
        if(i>=k){
            mi[++z]=qmin[head].s;
        }
        //////////
        /////////
        if(i-qmax[head2].id>=k){
            head2++;
        }
        while(qmax[tail2].s<=ys && tail2-head2>=0){
            tail2--;
        }
        qmax[++tail2].s=ys;
        qmax[tail2].id=i;
        if(i>=k){
            ma[++z2]=qmax[head2].s;
        }
    }
    for(i=1;i<=z;i++){
        cout<<mi[i]<<" ";
    }
    cout<<endl;
    for(i=1;i<=z2;i++){
        cout<<ma[i]<<" ";
    }
    return 0;
}