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
这个题的意思是怎么样让f+1个朋友分到最多快的派,但是每个人得到饼必须从一块上面拿下来,不能说这一块拿一点,那一块饼拿一点,不信你可以试试样例1。我一块是以为是求平均数 - -。
这个就用贪心做就可以了。假设最少每个人没有派,最多每个人都拿到最大一块。对派的半径求一下序(我是对r^2排的序),然后就一直找,二分找到那个最大的。。还有如果这个题用3.1415926过不去 。。 得用acos(-1)
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define pi 3.1415926
typedef long long ll;
const double esp=1e-8;
double f[10002];
int main()
{ int N,F,T;
cin>>T;
while(T--)
{
cin>>N>>F;
F=F+1;
for(int i=1;i<=N;i++)
{
cin>>f[i];
f[i]=f[i]*f[i];
}
sort(f+1,f+N+1);
/* for(int i=1;i<=N;i++)
{
cout<<f[i]<<endl;
}*/
double l=0,r=f[N],mid;
int sum=0;
while(r-l>=esp)
{ mid=(l+r)/2;
sum=0;
for(int i=1;i<=N;i++)
{
sum+=(int)f[i]/mid;
}
if(sum<F)
r=mid;
else l=mid;
}
printf("%.4lf\n",l*acos(-1));
}
return 0;
}