《算法艺术与信息学竞赛》之 排序与检索 二分 URAL 1184 电缆

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 contains two integers 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 are written with a centimeter precision, with exactly two digits after a decimal point.
Output
Write 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).

这道题比较明显是二分。
首先由一点：网线越短，网线就越多，就越可能合法。故可以二分
具体直接上代码，注意答案和二分边间问题。

#include<cstdio>
using namespace std;
int n,k;
double a[10005];
long long b[10005];
bool judge(int x){//判断是否成立 
    int num=0;
    for(int i=1;i<=n;i++){
        if(b[i]>=x)
            num+=b[i]/x;
        if(num>=k)break;
    }
    if(num>=k)
        return true;
    else
        return false;
}
int main(){
    scanf("%d%d",&n,&k);
    long long l=0,r=0;
    for(int i=1;i<=n;i++){
        scanf("%lf",&a[i]);
        b[i]=(a[i]*100);
        r+=b[i];
    }
    if(r<k){//特殊情况 
        printf("0.00\n");
        return 0;
    }
    long long mid;
    while(l<r){//二分 
        mid=(l+r)>>1;
        if(judge(mid))
            l=mid+1;
        else
            r=mid;
    }
    int res=l-1;//注意，最后的答案应该为l-1而不是mid，大家可以手动模拟一下 
    printf("%d.%d%d",res/100,(res/10)%10,res%10);
    return 0;
}