Pie HDU - 1969

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.

My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.

What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.

Input

One line with a positive integer: the number of test cases. Then for each test case:
---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.
---One line with N integers ri with 1 <= ri <= 10 000: the radii of the pies.

Output

For each test case, output one line with the largest possible volume V such that me and my friends can all get a pie piece of size V. The answer should be given as a floating point number with an absolute error of at most 10^(-3).

Sample Input

3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2

Sample Output

25.1327
3.1416
50.2655

题意：n个饼，m+1（务必记得还有自己来分）个人来分，且每个饼分成的每块不能拼接。

首先将每个饼的体积存入一个数组，对数据也就是每块的面积进行二分，从0到最大的那块面积的大小进行二分，测试每个mid值，用函数测试总的饼能不能分成m+1个体积mid，利用此得出最正确的mid值，为分得的面积（巧妙！！！）

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

const double pi=acos(-1.0);//反三角函数

int cal(double x,int n,double a[])
{
    int cou=0;
    for(int i=1;i<=n;i++)
    {
        cou+=(int)(a[i]/x);//一定要注意此处的强制类型转化，依次对x也就是mid测试n的大小，来计数
    }
    return cou;
}

int main()
{
    int n,p,q,r;
    double a[10010];
    scanf("%d",&n);
    while(n--)
    {
        double mid,left,right;
        left=right=0;
        scanf("%d %d",&p,&q);
        q++;
        for(int i=1;i<=p;i++)
        {
            scanf("%d",&r);
            a[i]=pi*r*r;//计数圆的面积
            right=max(a[i],right);
        }
        while(right-left>=1e-7)
        {
            mid=(right+left)/2;
            if(cal(mid,p,a)>=q)
            {
                left=mid;
            }
            else
            {
                right=mid;
            }
        }
        printf("%.4lf\n",mid);
    }
    return 0;
}