poj1064 Cable master (二分搜索)

#include <iostream>
#include <cstdio>
#include <algorithm>
#define INF 1000000
using namespace std;
int main()
{
    int n,k;
    int  a[100005];
    while(~scanf("%d %d",&n,&k))
    {
        double temp;
        for(int i=0;i<n;++i)
        {
            scanf("%lf",&temp);
            a[i]=temp*100;
        }
        sort(a,a+n);
        int low=1,high=a[n-1];
        int length_mid,MAX_length=0;
        while(high>=low)
        {
            length_mid=low+(high-low)/2;
            int sum=0;
            for(int i=0;i<n;++i)
            {
                sum+=a[i]/length_mid;
            }
            if(sum>=k)
            {
                low=length_mid+1;
                MAX_length=max(MAX_length,length_mid);

            }
            else
                high=length_mid-1;
        }
        printf("%.2f\n",(double)MAX_length/100.0);//cout<< MAX_length<<endl;
    }
    return 0;
}

注：printf("%.2lf\n",(double)MAX_length/100.0); WA