因为题目要求分给每个人的派都是来自一个派的而不是拼接的,所以没人得到的派大小一定小于最的大派,先从大到小排序。然后对第一个(最大的派)进行二分操作,low=0,high=最大派的大小。mid=(high+low)/2。判断如果以这个大小能否得到指定块数的派。
源代码:
#include<stdio.h>
#include<algorithm>
#define pi 3.14159265358979323846
using namespace std;
double r[10010];
int n, f;
int cmp(const int &a, const int &b){
if (a > b)return 1;
else return 0;
}
int num(double a){
long long sum = 0;
for (int i = 0; i < n; i++){
sum += (int)(r[i] / a);
}
if (sum >= f)return 1;
else return 0;
}
int main(){
int t;
scanf("%d", &t);
while (t--){
scanf("%d%d", &n, &f);
f++;
for (int i = 0; i < n; i++){
scanf("%lf", &r[i]);
r[i] = r[i] * r[i] * pi;
}
sort(r, r + n,cmp);
double high = r[0], low = 0, mid;
while (high - low > 0.00001){
mid = (high + low) / 2;
if (num(mid))low = mid;
else high = mid;
}
mid = (high + low) / 2;
printf("%.4f\n", mid);
}
return 0;
}