[POJ1064]Cable master

题目链接：http://poj.org/problem?id=1064

卡精度…恶心了很久很久最终还是过了，真是各种姿势啊。。。

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <climits>
#include <complex>
#include <fstream>
#include <cassert>
#include <cstdio>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <ctime>
#include <set>
#include <map>
#include <cmath>

using namespace std;

const double eps = 1e-15;
const int maxn = 10010;
const int INF = 1 << 30;

int n, k;
double line[maxn];

bool ok(double x) {
    int cnt = 0;
    for(int i = 0; i < n; i++) {
        cnt += int(line[i] / x);
    }
    return cnt >= k;
}

int main() {
    // freopen("in", "r", stdin);
    while(~scanf("%d %d", &n, &k)) {
        for(int i = 0; i < n; i++) {
            scanf("%lf", &line[i]);
        }
        double ll = 0, rr = INF;
        // while(rr - ll > eps) {
        //     double mm = (ll + rr) / 2;
        //     if(ok(mm)) {
        //         ll = mm;
        //     }
        //     else {
        //         rr = mm;
        //     }
        // }
        for(int i = 0; i < 100; i++) {
            double mm = (ll + rr) / 2;
            if(ok(mm)) {
                ll = mm;
            }
            else {
                rr = mm;
            }    
        }
        printf("%.2lf
",floor(rr * 100) / 100);
    }
}