样例过不了

#include<iostream>
#include<queue>
using namespace std;
int n,k,a[100001];
deque<int>s;
int main(){
	cin>>n>>k;
	for (int i=1;i<=n;++i){
		cin>>a[i];
	}
	for (int i=1;i<=n;++i){
		while (!s.empty()&&s.front()<=a[i]){
			s.pop_front();
		}
		s.push_front(a[i]);
		while (s.size()>k){
			s.pop_back();
		}
		if (i>=k){
			cout<<s.back()<<" ";
		}
	}
	cout<<endl;
	for (int i=1;i<=n;++i){
		while (!s.empty()&&s.front()>=a[i]){
			s.pop_front();
		}
		s.push_front(a[i]);
		while (s.size()>k){
			s.pop_back();
		}
		if (i>=k){
			cout<<s.back()<<" ";
		}
	}
	return 0;
}