﻿HDU 1969 Pie（二分搜索）-Ocrosoft

# Pie

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

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

```

Solution

```#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <conio.h>
#include <cmath>
#include <algorithm>
#include <list>
#include <stack>
#include <string>
#include <vector>
#include <cstring>
#include <cctype>
#include <queue>
#include <set>
#include <climits>
#define ms(a) memset(a,0,sizeof(a))
using namespace std;
double cake[10010];
int n,m;
int cmp(double a,double b)
{
return a>b;
}
bool check(double s)
{
int cnt=0;
for(int i=0; i<n; i++)
{
cnt+=(int)(cake[i]/s);
//cnt+=cake[i]/s;//这样是错误的
if(cnt>=m)return 1;
}
return 0;
}
int main()
{
int N;
cin>>N;
while(N--)
{
cin>>n>>m;
m++;//自己要分一块
for(int i=0; i<n; i++)
{
cin>>cake[i];
cake[i]=cake[i]*acos(-1.0)*cake[i];
}
sort(cake,cake+n,cmp);
if(n>m)n=m;
double l=0,r=cake[0],mid;
while(r-l>1e-6)
{
mid=(l+r)/2;
if(check(mid))l=mid;
else r=mid;
}
printf("%.4lf\n",l);
}
return 0;
}
```