二分法--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

Pie的面积是处于0~MaxS之间的某值，因此二分并逐一尝试是否满足条件

#include
#include
#include
#define maxn 10005
double S[maxn];
const double PI = acos(-1.0);
int N, F;
using namespace std;
double bs(double MaxS){
  double Min = 0, Mid, Max = MaxS;
  while (Max - Min>0.00001){                                              //注意这里的循环条件
    Mid = (Max + Min) / 2;
    int sum = 0;
    for (int i = 0; i < N; i++){
      sum += S[i] / Mid;
    }
  if (sum>=F + 1){                                                      //这里原本将>与==两种情况分开
      Min = Mid;                                                                            并且当sum==F+1时直接退出并返回Mid值作为结果，结果错误
    }
    else Max = Mid;
  }
  return Max;                                                                      //return Max or Min均可
}
int main(){
  int T;
  cin >> T;
  while (T--){
    double MaxS = -1,r;                                        //为了比较并储存最值预先将之设为-1
    double ans;                                                           
    cin >> N >> F;
    for (int i = 0; i < N; i++){
      cin >> r;
      S[i] = r*r*PI;
      if (MaxS < S[i]){
        MaxS = S[i];
      }
    }
    ans = bs(MaxS);
    printf("%.4f\n", ans);
  }
  return 0;
}