UVA-PIE

题目大意：给你N个蛋糕的直径，让你给F+1个小朋友分蛋糕，每个小孩的蛋糕必须是一整块的，不能是拼起来的且面积大小一样大，问这个面积最大是多大

先算每块蛋糕的面积，再从这个蛋糕里面二分出相应的大小就可以

#include<stdio.h>
#include<iostream>
#include<algorithm>

using namespace std;
int F, n;
double con[10005];
const double PI = acos(-1.0);

bool judge(double a){
	int t=0;
	for (int i = 0; i < n; i++){
		t += con[i] / a;
	}
	if ( t >= F + 1)	return true;
	return false;
}

int main(){
	int test;
	scanf_s("%d",&test);
	while (test--){
		F = 0; n = 0;
		double low = 0.0, maxcon;
		scanf_s("%d%d", &n, &F);
		for (int i = 0; i < n; i++){
			//scanf_s("%f", &con[i]); 
			cin >> con[i];
			con[i] = PI* con[i] * con[i];
			maxcon = max(maxcon, con[i]);
			//cout << con[i] << endl;
		}
		double mid;
		while (maxcon - low>1e-5){
			mid = low + (maxcon - low) / 2;
			if (judge(mid)) low = mid;
			else maxcon = mid;
		}
		printf("%.4lf\n", low);
	}
	return 0;
}