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.
---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.
3 3 3 4 3 3 1 24 5 10 5 1 4 2 3 4 5 6 5 4 2
25.1327 3.1416 50.2655
题意:几个人分饼,但是不能一个人的饼是由几个饼拼凑起来的,也就是有a[0]/x+a[1]/x+...+a[n]x>=y+1(y为人数);
代码:
#include<cstdio>
#include<algorithm>
#include<math.h>
using namespace std;
double a[10005];
int n,f;
double mid;
bool cmp(double a,double b)
{
return a>b;
}
int check(double mid)
{int sum=0;
for(int i=0;i<n;i++)
{
sum=sum+(int)(a[i]/mid);
if(sum>=f)
return 1;
}
return 0;
}
int main()
{int t;
scanf("%d",&t);
double pi=acos(-1.0);
while(t--)
{
scanf("%d%d",&n,&f);
f++;
for(int i=0;i<n;i++)
{
scanf("%lf",&a[i]);
a[i]=a[i]*a[i]*pi;
}
sort(a,a+n,cmp);
double r=a[0],l=0;
while(r-l>0.00001)
{
mid=(r+l)/2.0;
if(check(mid))
l=mid;
else r=mid;
}
printf("%.4lf\n",l);
}
return 0;
}