30分，TLE，求调

#include<iostream>
#include<cmath>
using namespace std;
int main()
{	 
	int n,w; 
	cin>>n>>w;
	int const tmpn=n+1;
	int score[tmpn]={0};
	int tmp,num,ans[tmpn]={0};
	for(int i=1;i<=n;i++)
	{
		cin>>score[i];
		for(int j=1;j<=i;j++)
		{
			for(int k=1;k<=i-j;k++)
			{
				if(score[k]<score[k+1])
				{
					tmp=score[k];
					score[k]=score[k+1];
					score[k+1]=tmp;
				}
			}
		}
		num=floor(i*(w*1.00/100));
		ans[i]=score[max(1,num)];
	}
	for(int i=1;i<=n;i++)
	{
		cout<<ans[i]<<' ';
	}
	return 0;
}