题解

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
int bucket[605];
int main(){
int n,s;
double w;
scanf("%d%lf",&n,&w);
for(int i=1;i<=n;i++){
scanf("%d",&s);
bucket[s]++;
int q=i*w/100;
int k=max(1,q),num=0,flag=0;
for(int j=600;j>=0;j--){
num+=bucket[j];
if(num>=k){
cout<<j<<" ";
break;
}
}
}
return 0;
}