#include <iostream>
#include <stdio.h>
#include <algorithm>
const int N = 1e5 + 10;
int a[N];
int n, m;
using namespace std;
bool check(double mid) {
int cnt = 0;
for (int i = 1; i <= n; i ++) {
//将每段绳子分成mid的长度,可以分成多少段
cnt += a[i] / mid;
}
//如果段数大于m就返回真
return cnt >= m;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i ++)
cin >> a[i];
double l = 0, r = 1e9;
//二分寻找答案
while (r - l > 1e-4) {
double mid = (l + r) / 2;
if (check(mid))
l = mid;
else
r = mid;
}
printf("%.2lf", r);
return 0;
}
P559 剪绳子(3月27日)
最新推荐文章于 2024-07-12 22:49:40 发布