HDU1551：Cable master(二分)

Description

Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it. 

To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible. 

The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter, and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled. 

You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces. 

 

Input

The input consists of several testcases. The first line of each testcase contains two integer numbers N and K, separated by a space. N (1 ≤ N ≤ 10000) is the number of cables in the stock, and K (1 ≤ K ≤ 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 centimeter and at most 100 kilometers in length. All lengths in the input are written with a centimeter precision, with exactly two digits after a decimal point. 

The input is ended by line containing two 0's. 

 

Output

For each testcase write to the output the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a centimeter precision, with exactly two digits after a decimal point. 

If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output must contain the single number "0.00" (without quotes). 

 

Sample Input

    
    

     
     4 11
8.02
7.43
4.57
5.39
0 0 
    
    

 

Sample Output

    
    

     
     2.00 
    
    

 

题意：给出n条线段，以米的单位给出，小数点后两位（精确到厘米），要你对这些线段裁剪，裁剪出m条等长的线段，并且让这些线段尽可能长另外线段的长度不能小于1厘米，如果筹不够m条，输出0.00

做法就是二分答案，但是二分的区间有讲究

一开始我认为长度的上限应该是  min { len[i] }，即最短的那条线段，后来才想到是错的，应该是max{ len[i] }，因为有一点想当然了，认为裁剪线段，就是每条线段都要裁剪，其实不是的，并不是每条线段都要裁剪

好像

4 2

2.00

3.00

4.00

答案是2.00吗？不是的，应该是3.00，虽然3.00大于第一条线段的长度，那么就不要裁剪第1条线段，直接从第2，第3条线段开始裁剪，就能裁剪出2条3.00长度的线段

#include<cstdio>
#include<cmath>
#define eqs 1e-8
double a[10010];
int n,k;
int judge(double mid)
{
	int cnt=0,i;
	for(i=0;i<n;i++)
	  cnt+=int(a[i]/mid);
	if(cnt>=k)
	  return 1;
    return 0;		
}
int main()
{
	while(scanf("%d%d",&n,&k)&&n||k)
	{
		double l=0,mid,r,sum=0;
		for(int i=0;i<n;i++)
		{
			scanf("%lf",&a[i]);
			sum+=a[i];
		}
		r=sum/k;
		while(fabs(l-r)>eqs)
		{
			mid=(l+r)/2;
			if(judge(mid))
			  l=mid;
			else r=mid;
		}
		printf("%.2lf\n",l);
	
	}
	return 0;
}