60pts,求助(1WA,7TLE)!
查看原帖
60pts,求助(1WA,7TLE)!
939574
Eric_Berlin_NOI楼主2024/6/8 13:31
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
int a[N],b[N];
bool cmp(int x,int y){
	return x>y;
}
int main()
{
	int n;
	double w;
	cin>>n>>w;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		int p=max(1,(int)(i*(w/100*1.00)));
		sort(a+1,a+i+1,cmp);
		b[i]=a[p];
	}
	for(int i=1;i<=n;i++){
		cout<<b[i]<<" ";
	}
	return 0;
}
2024/6/8 13:31
加载中...