# J - Pie解题报告（黄杰）

J - Pie
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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<stdio.h>
#include<math.h>
#define MAX 10001
#define PI acos(-1.0);//精确度提高。
int main()
{
int num,n,f,r,i,sum;
double low,high,mid,v[MAX];
scanf("%d",&num);
while(num--)
{
scanf("%d%d",&n,&f);
low=0;
high=0;
for(i=0;i<n;i++)
{
scanf("%d",&r);
v[i]=r*r*PI;
high+=v[i];
}
f+=1;//包括自己.
high/=f;
while(high-low>=1e-7)
{
sum=0;
mid=(low+high)/2.0;
for(i=0;i<n;i++)
sum+=(int)(v[i]/mid);//记录可以分成多少块。
if(sum>=f)
low=mid;
else
high=mid;
}
printf("%.4f\n",mid);
}
return 0;
}

#### F - Babelfish解题报告（黄杰）

2012-03-21 13:43:39

#### A - SnowflakeSnowSnowflakes解题报告（黄杰）

2012-03-21 13:34:57

#### D - Eqs解题报告（黄杰）

2012-03-21 13:41:43

#### Pie解题报告

2012-03-25 20:39:26

#### G - Monthly Expense解题报告（黄杰）

2012-03-21 13:38:55

#### I - Expanding Rods解题报告（黄杰）

2012-03-21 13:46:20

#### NOIP2016提高组复赛 解题报告

2016-12-01 21:52:57

#### 2015年第六届蓝桥杯省赛（C/C++ B组）解题报告

2015-04-12 10:49:04

#### 【cogs 597】【dp】交错匹配

2015-07-01 17:28:53

#### 福利：饿了么《分布式时序数据库 - LinDB》！

2018-04-23 17:44:59