POJ1064 Cable master（二分搜索）

题目链接：http://poj.org/problem?id=1064

Cable master

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 24916		Accepted: 5343

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 first line of the input file contains two integer numb ers 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 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.

Output

Write to the output file 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 file must contain the single number "0.00" (without quotes).

Sample Input

4 11
8.02
7.43
4.57
5.39

Sample Output

2.00

题意：给你n条绳子，长度分别为Li，现在要从他们中切出k条长度相同的绳子，求这个长度的最大值。

一开始想要直接搜索，但是算法并不是十分容易考虑，后来想到了二分的方法。

二分的边界为0到INF，每次判断这个长度是否满足条件。条件为每条绳子尽可能切成想要的形状，绳子个数是否为k。

假设二分的数值为x，则每条长度为L的绳子，最多可以切出（int）（Li/x）条绳子。只要把所有的数字加起来就可以求出绳子的总个数。如果总个数大于k，说明长度太短，二分有半部分，否则二分左半部分。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;

int n,k;
double sl[10005];

int main()
{
	while (scanf("%d%d",&n,&k)!=EOF)
	{
		for (int i=0;i<n;i++)
		{
			scanf("%lf",&sl[i]);
		}
		double head=0,tail=1000000.0;
		while (tail-head>1e-6)
		{
			double mid=(head+tail)/2;
			int sum=0;//判断二分条件是否满足
			for (int i=0;i<n;i++)
			{
				sum+=(int)(sl[i]/mid);
			}
			if (sum>=k) head=mid;else tail=mid;
		}
		printf("%.2lf\n",(int)(tail*100)/100.0);//保留两位小数
	}
	return 0;
}