Educational Codeforces Round 91 (Rated for Div. 2) C. Create The Teams (模拟)

• 题意:有\(n\)个队员,每个队友都有一个能力值,构造队伍,要求队伍人数*队伍中最低能力值不小于\(x\),求能构造的最大队伍数.

• 题解:大水题,排个序,倒着模拟就行了.

• 代码:

  int t;
  int n,x;
  ll a[N];
  int ans;
   
  int main() {
      ios::sync_with_stdio(false);cin.tie(0);
    	cin>>t;
    	 while(t--){
    	 	cin>>n>>x;
    	 	ans=0;
    	 	 for(int i=1;i<=n;++i){
    	 	 	cin>>a[i];
    	 	 }
    	 	 sort(a+1,a+1+n);
    	 	 ll cnt=0;
   
    	 	 for(int i=n;i>=1;--i){
    	 	 	cnt++;
    	 	 	if(cnt*a[i]>=x){
    	 	 		ans++;
    	 	 		cnt=0;
    	 	 	}
    	 	 }
    	 	 cout<<ans<<endl;
    	 }
   
      return 0;
  }
  

Educational Codeforces Round 91 (Rated for Div. 2) C. Create The Teams (模拟)

原文：https://www.cnblogs.com/lr599909928/p/13322092.html