版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/wulianwangxuchenqi/article/details/79254563
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
int cmp(const void *a, const void *b){
return *(double *)a > *(double *)b ? 1 : -1;
}
int main(){
int m, n;
double a[610], b[610];//a[i]存放半径,b[i]存放每个喷水装置能覆盖的最大长度
scanf("%d", &m);
while(m--){
int j = 0, q=0;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%lf", &a[i]);
if(a[i]<=1.0) continue;
else {
b[j++]=2*(sqrt(a[i]*a[i]-1.0));
}
}
qsort(b, j, sizeof(b[0]), cmp);
double sum = 20.0;
for(int i = j-1; i >=0; i--){
sum -= b[i];
q++;
if(sum <= 0.0){
printf("%d\n", q);
break;
}
}
}
return 0;
}