只得了50，请大佬帮忙看看

题目传送

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int w;
int a[100005],b[100005],fs;
bool cmp(int x,int y){
 return x>y;
}
int main()
{
	cin>>n>>w;
	for(int i = 1;i <= n;i++){
		cin>>a[i];
		sort(a + 1,a + n + 1,cmp);
		fs = i * w / 100;
		if(fs != 0) cout<<a[fs]<<" ";
		else cout<<a[fs + 1]<<" ";
	}
	
	return 0;
}