50pts求调或者找反例（不让下数据

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
#define int long long
using namespace std;
int a[100005],sta[100005],top;
int n,c;
signed main(){
	scanf("%lld%lld",&n,&c);
	for(int i = 1;i <= n;i++) scanf("%lld",&a[i]);
	for(int i = 1;i <= n;i++){
		int rst = c - top,minn = 0x3f3f3f3f;
		if(rst) for(int j = i;j <= min(i + rst - 1,n);j++) minn = min(minn,a[j]);
		while((top && sta[top] <= minn)){
			printf("%lld ",sta[top]);
			top--,rst++;
			minn = min(a[min(i + rst - 1,n)],minn);
		}
		if(minn >= a[i] || rst == 1) printf("%lld ",a[i]);
		else sta[++top] = a[i];
	}		
	while(top){
		printf("%lld ",sta[top]);
		top--;
	}
	return 0;
}