杭电-1969 Pie(二分)
2016-07-27 14:33
369 查看
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9356 Accepted Submission(s): 3391
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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).
[align=left]Sample Input[/align]
3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2
[align=left]Sample Output[/align]
25.1327
3.1416
50.2655
[align=left]Source[/align]
NWERC2006
[align=left]Recommend[/align]
wangye | We have carefully selected several similar problems for you: 2899 2446 2298 2333 1399
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
const double pi = acos(-1.0);
double a[10005];
int n,m;
int check(double mid)
{
int i;
int sum = 0;
for(i = 0; i<n; i++)
{
sum+=int(a[i]/mid);
if(sum>=m)
return 1;
}
return 0;
}
int cmp(double a,double b)
{
return a>b;
}
int main()
{
int t,i,j;
double l,r,mid;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
m++;
for(i = 0;i<n; i++)
{
scanf("%lf",&a[i]);
a[i] = a[i]*a[i]*pi;
}
sort(a,a+n,cmp);
l = 0;
r = a[0];
while(r-l>1e-5)
{
mid = (r+l)/2;
if(check(mid))
l = mid;
else
r = mid;
}
printf("%.4lf\n",l);
}
return 0;
}
相关文章推荐
- 链表删除重复元素
- SQL编程——MySQL数据库基本操作
- MyEclipse配置svn和maven
- 总结之线段树1
- hdu 1003 Max Sum
- UIView release, message send to deallocated instance
- 跨源资源共享(CORS)
- iOS开发--用企业证书生成IPA包遇到的坑
- 监控WebSphere相关性能参数
- Java中break、continue与return的区别
- 【学习】js学习笔记:数组(二)
- 单个字符串多行显示
- 对uiview实现部分圆角
- CSU 1767: 想打架吗?算我一个!所有人,都过来!(2)
- RecyclerView实现横向的GridView效果
- Git远程操作详解
- 274. H-Index
- Android微信分享和邮件分享
- 什么是威胁情报以及它如何有助于识别安全威胁
- 从MySQL全库备份中恢复某个库和某张表