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
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cmath>
#define ll long long int
#define ull unsigned long long int
#pragma warning(disable:4996)
#define pf printf
#define sf scanf
#define min(a,b) (a)>(b)?(a):(b);
double PI = acos(-1.0);
int n, f;
double v[100000];
/*
直接体积逼近最大的可能值,WA多半是精度问题,调下精度和PI
*/
bool slove(double mid) {
int sum = 0;
for (int i =0; i < n; i++) {
sum +=(int)(v[i] / mid);//每一个饼单独查看,看能分成几个体积为mid的饼
}
if (sum >= f + 1) return true;//相等时,minv还可以右移
else return false;//maxv左移
}
int main(void) {
int t;
sf("%d", &t);
while(t--) {
sf("%d %d", &n, &f);
double maxv = 1e9;//最大的体积PI*10000*10000
double minv = 0;//最小体积
double mid;
double ans = 0;
for (int i = 0; i < n; i++) {
sf( "%lf",&v[i] );
v[i]=v[i] * v[i] * PI;
}
while (maxv - minv >= 1e-6) {//minv==maxv
mid = (maxv + minv) / 2;
if (slove(mid)) {//单个体积为mid的饼太小,minv 右移
minv = mid;
ans = mid;
}
else {
maxv = mid;//单个体积为mid的饼体积太大,maxv左移
}
}
pf("%.4lf\n", ans);
}
return 0;
}