# POJ_1129 pie 解题报告

J - Pie
Crawling in process... Crawling failed 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<iostream>
#include <cmath>
using namespace std;
int A,B;
double V[10000];//用于记录每个饼的体积。
double pi = acos ( -1.0 );//精确求pi的值。
int test(double mid)//二分的测试过程。
{
int num=0;
int i;
for(i=0;i<A;i++)
{
num+=V[i]/mid;//求饼可以分成的总人数.
}
if(num>B)
return 1;
else
return 0;
}
int main()
{
int i,N,r;
double v,R,L,mid;
scanf("%d",&N);
while(N--)
{
v=0;
scanf("%d%d",&A,&B);
for(i=0;i<A;i++)
{
scanf("%d",&r);
V[i]=r*r*pi;
v+=V[i];
}
L=0;
R=v/(B+1);//计算每个人可分到的最大体积数。
while((R-L)>1e-6)
{
mid=(R+L)/2;
if(test(mid)==1)
L=mid;
else
R=mid;
}
printf("%.4lf\n",mid);
}
return 0;
}

#### Pie解题报告

2012-03-25 20:39:26

#### poj_1129

2015-03-20 13:28:22

#### POJ 3122 Pie解题报告

2012-03-16 13:38:22

#### 二分查找——D:Pie 解题报告

2016-07-22 14:13:20

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

2012-03-21 13:36:47

#### POJ-1129 Pie 解题报告

2012-03-11 23:29:59

#### 【Jason's_ACM_解题报告】Pie

2015-02-04 11:33:17

#### poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告

2009年10月06日 9KB 下载

#### float pie float pie float pie float pie

2008年12月25日 71KB 下载

#### GCC中的pie和fpie选项

2010-03-10 08:35:00