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 com- plaining. 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 10000: the number of pies and the number of
friends. One line with N integers r i with 1 r i 10000: 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 oating point
number with an absolute error of at most 10
注意到答案具有单调性,即如果答案x可以,x-eps也可以【原来的每一块切掉一点就可以了】,所以可以二分答案,这样就可以算出每个蛋糕最多提供多少份,与f+1比较。
#include<cstdio>
#include<cstring>
#include<cmath>
const double pi=acos(-1),eps=1e-5;
int n,f;
double s[10010];
bool ok(double x)
{
int ans=0,i;
for (i=1;i<=n;i++)
ans+=s[i]/x;
return ans>=f;
}
int main()
{
int T,i,x;
double l,r,mid;
scanf("%d",&T);
while (T--)
{
scanf("%d%d",&n,&f);
f++;
r=0;
for (i=1;i<=n;i++)
scanf("%d",&x),s[i]=pi*x*x,r+=s[i];
l=0;
while (fabs(r-l)>eps)
{
mid=(l+r)/2;
if (ok(mid)) l=mid;
else r=mid;
}
printf("%.4f\n",l);
}
}