# 2006 ACM Northwestern European Programming Contest C题(二分求最大)

654人阅读 评论(0)

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberN 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 ≤ 10000: the number of pies and the number of friends.
• One line with N integers ri with 1 ≤ri ≤ 10000: the radii of the pies.

## Output

For each test case, output one line with the largest possible volumeV 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

The 2006 ACM Northwestern European Programming Contest

#include <iostream>
#include <cmath>
using namespace std;

#define MAX(a, b) ((a) > (b) ? (a) : (b))

const int maxn = 10010;
const double PI = acos(-1.0);
double s[maxn];
int n, f, r;

int ok(double x)
{
int sum = 0;
for (int i = 0; i < n; i++) sum += floor(s[i] / x);
return sum >= f + 1;
}

int main()
{
int T;
cin>>T;
while (T--)
{
cin>>n>>f;
double max = -1;//找最大圆的面积
for (int i = 0; i < n; i++)
{
cin>>r;
s[i] = PI * r * r;
max = MAX(max, s[i]);
}

//二分找最大
double L = 0, R = max;
while (R - L > 1e-5)
{
double M = (L + R) / 2;
if (ok(M)) L = M;
else R = M;
}
printf("%.5lf\n", L);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：55133次
• 积分：1153
• 等级：
• 排名：千里之外
• 原创：59篇
• 转载：2篇
• 译文：0篇
• 评论：6条
阅读排行
评论排行
最新评论