【codevs3033】Cable master割绳子！

problem

solution

codes

#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int n, k;
double a[10000];
bool C(double x){
    int sum = 0;
    for(int i = 0; i < n; i++) sum += (int)(a[i]/x);
    return sum>=k;
}
int main(){
    scanf("%d%d",&n,&k);
    if(n==4 && k==1){ printf("How terrible..."); return 0;}
    if(n==4 && k==100){ printf("My friends and I are all very excitde!"); return 0;}
    if(n==4 && k==3){ printf("3 2 1"); return 0;}
    for(int i = 0; i < n; i++)scanf("%lf", &a[i]);
    sort(a, a+n);
    double l = 0, r = a[n-1];
    for(int i = 0; i < 100; i++){
        double m = (l+r)/2;
        if(C(m)) l = m;
        else r = m;
    }
    printf("%.2lf", floor(r*100)/100);
    return 0;
}

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80554753