POJ 3122 Pie

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

题意大致为，有n个大小不一的派，共f+1个人（包括自己）来分这些派。要求每个人分得的派必须是从同一个派中取得。

思路，在输入每个派大小的时候记录最大的一个作为二分的上界，下界为0。对于每个mid，遍历每个派的大小，看够分给几个人，最终算出所有的派，按照mid大小，共可以分给多少人。然后跟需要分的人数对比。如果够分，尝试更大的mid，如果不够，尝试更小。

遇到的问题，理解的时候，错理解成了最后每块的大小，必须被每个派的大小整除。而实际上，每个分得的大小，甚至可以超过某些派的大小，即这些派被丢弃，而其他的派被分完剩下的部分，也可以丢弃。