题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1969
Pie
Problem 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.
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.
---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
题目分析:n个饼 并且分给m+1个人(因为要算上本人),下一行输入n个饼的半径,注意饼是不能拼接的,不能有两块及两块以上拼成的饼。二分搜索:left为0,right为最大值。找到一次mid,就去判断是否每个人都可以有一块mid。注意:(1)精度为1e-5 (2)pi的取值。
#include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
using namespace std;
double pi=acos(-1.0);
double a[10005];
int n,m;
int check(double mid)
{
int sum=0;
for(int i=0;i<n;i++)
{
int ss=a[i]/mid;
sum+=ss;
//满足所有人都能分到相等的一块
if(sum>=m)
return 1;
}
return 0;
}
int cmp(double a,double b)
{
return a>b;
}
int main()
{
int t,i,j;
double left,right,mid;
cin>>t;
while(t--)
{
//n个饼,m个人。
cin>>n>>m;
m=m+1;
for(i=0;i<n;i++)
{
cin>>a[i];
a[i]=a[i]*a[i]*pi;
}
//从大到小排序
sort(a,a+n,cmp);
left=0;
right=a[0];
if(m<n)
n=m;
while(right-left>0.0000001)
{
mid=(right+left)/2;
if(check(mid))
left=mid;
else
right=mid;
}
cout<<setprecision(4)<<fixed<<left<<endl;
}
return 0;
}