POJ1064 二分

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条长度相同的绳子的话，这K条绳子每条最长能有多少？保留2位小数。

分析：

用二分搜索，条件:C(x):可以得到K条长度为x的绳子，问题就是求满足C(x)的最大x。代码如下：

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
const double INF=10000001;
int N,K;
double L[10005];
bool C(double x)
{
    int num=0;
    for(int i=1;i<=N;i++)
    {
        num+=(int)(L[i]/x);
    }
    return num>=K;
}
int main()
{
    while(scanf("%d%d",&N,&K)!=EOF)
    {
         double le=0,ri=INF;
        for(int i=1;i<=N;i++)
        {
            scanf("%lf",&L[i]);
        }
        for(int i=0;i<100;i++)//1次循环可以缩小区间的一半，100次足够达到要求
        {
            double mid=(le+ri)/2;
            if(C(mid)) le=mid;
            else ri=mid;
        }
        printf("%.2f
",floor(ri*100)/100);
    }
    return 0;
}