题意n个蛋糕 m个人,求每个人最大获得蛋糕
思路:用最大的pie与0二分
#include <iostream>
#include <cstdio>
#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];
if(m<n)
n = m;
while(r-l>1e-5)
{
mid = (r+l)/2;
if(check(mid))
l = mid;
else
r = mid;
}
printf("%.4lf\n",l);
}
return 0;
}
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这里写代码片