#include <bits/stdc++.h>
using namespace std;
int n,w,a[100020],p[100020];
priority_queue<int,vector<int>,greater<int>> x;
priority_queue<int> y;
int main (){
	cin>>n>>w;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		p[i]=max(1,(int)floor(i*w*0.01));
	}
	for(int i=1;i<=n;i++){
		if(!y.empty()&&y.top()>a[i]){
			y.push(a[i]);
			while(x.size()<p[i]){
				x.push(y.top());
				y.pop();
			}
		}else{
			x.push(a[i]);
			while(x.size()>p[i]){
				y.push(x.top());
				x.pop(); 
			}
		}
		cout<<x.top()<<" ";
	}
	return 0;
}

题目