【HUD 1969】Pie（二分）



Pie

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

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
  
  
  
  


  
  
  
  

   
   题目大意：告诉每个蛋糕的半径，分给f+1个人（包括自己），每个人分得的体积相同，一个蛋糕可以切成很多块，但不能两个拼凑，求最大分得的体积
  
  
  
  

   
   思路：二分更新答案
  
  
  
  

   
        求Pi可以这样 double Pi = acos(-1.0)
  
  
  
  


  
  
  
  

   
   
#include<bits/stdc++.h>
#define manx 10004
double Pi = acos(-1.0);
using namespace std;
int t,n,f,x;

double a[manx];
bool fun(double mid)
{
    int cot = 0;
    for (int i = n-1; i >= 0; i--){
        cot += (int)(a[i]/mid);  //不加int会wa，mid是double型内存溢出
        if(cot >= f+1) return true;
    }
    return false;
}

void solve()
{
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&f);
        double sum=0;
        for (int i=0; i<n; i++){
            scanf("%d",&x);
            a[i]=x*x*Pi;
            sum+=a[i];
        }
        sort(a,a+n);
        double l=0,r=sum/(f+1),mid;
        while(fabs(r-l) > 1e-7){
            mid=(l+r)/2;
            if(fun(mid)) l=mid;
            else r=mid;
        }
        printf("%.4f\n",mid);
    }
}
int main()
{
    solve();
    return 0;
}