POJ1064-Cable master

#include <cstdio>
#include <cmath>

const int maxn = 10000;

double cab[maxn];

bool judge(double a, int n, int k) {
int ans = 0;
for (int i = 0; i < n; i++) {
ans += floor(cab[i] / a);
}
return ans >= k;
}

int main(int argc, char const *argv[]) {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lf", &cab[i]);
}
double left = 0;
double right = 100000;
double ans = 0;
for (int i = 0; i < 100; i++) {
double mid = (left + right) / 2.0;
ans = mid;
if (judge(ans, n, k)) {
left = mid;
} else {
right = mid;
}
}
printf("%.2f\n", floor(ans*100)/100);
return 0;
}