POJ 3122 Pie

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.

---

【题目分析】
这图有毒。题目很简单，很容易想到正解，只需要二分一下，然后向下取整判断是否可行就好了，感觉精度要求并不是很严格。轻松水过。

---

【代码】

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
const double pi=3.1415926535897932;
double p[10001];
int t,n,f;
int main()
{
    ios::sync_with_stdio(false);
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d%d",&n,&f);f++;
        double sum=0;
        for (int i=1;i<=n;++i)
        {
            int r;cin>>r;
            p[i]=r*r;
            sum+=p[i];
        }
        double l=0,r=sum/f,mid;
        while (r-l>1e-7)
        {
            mid=(l+r)/2;
            int cnt=0;
            for (int i=1;i<=n;++i)
                cnt+=(int)(p[i]/mid);
            if (cnt>=f) l=mid;
            else r=mid;
        }
        printf("%.4f\n",mid*pi);
    }
}