（二分）POJ 1064 cable masters

n条绳子可有k段，最长每段有多长，把浮点型转换成整型了

#include<stdio.h>
int main()
{
    int n,k,i,min,max,mid,a[10005],count,s;
    double len;
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        s=0;
        min=1;
        max=0;
        for(i=0;i<n;i++)
        {
            scanf("%lf",&len);
            a[i]=len*100;
            if(a[i]>max)
                max=a[i];
        }
        while(min<=max)
        {
            count=0;
            mid=(min+max)/2;
            for(i=0;i<n;i++)
                    count+=a[i]/mid;
            if(count>=k)
            {
                if(mid>s)
                    s=mid;
                min=mid+1;
            }
            else
                max=mid-1;
        }
        printf("%.2f\n",s/100.0);
    }
    return 0;
}