Pie（HDU 1969） —— 二分

Pie

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4012    Accepted Submission(s): 1624

Problem Description

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
   
   
   
   

 

需要认真思考其判断条件，利用二分思想解决

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
#define p acos(-1.0) //π
int main()
{
    int T,n,f;
    double r[10010];

    while(~scanf("%d", &T))
    while(T--)
    {
        scanf("%d%d", &n,&f);
        for(int i=0; i<n; i++)
            scanf("%lf", r+i);
        sort(r,r+n);
        double low = 0.0, high = p*r[n-1]*r[n-1], mid;
        while(high-low > 1e-7)
        {
            mid = low+(high-low)/2;
            int sum = 0;
            for(int i=0; i<n; i++)
                sum += p*r[i]*r[i]/mid;
            if(f+1 > sum) high = mid; //当sum小，此时mid大，则要寻找的数比中间值小
            else  low = mid; //需要找最大值，故是当f+1<=sum时！
        }
        printf("%.4f\n",mid);
    }
    return 0;
}