题目
代码
#include <iostream>
#include <algorithm>
using namespace std;
double a[100007];
int n, m;
int f1(double mid){
int re = 0;
for(int i=0;i<n;i++)
re+=int(a[i])/mid;
return re;
}
double f2(double l,double r){
while(1){
double mid = (l+r)/2;
if(f1(mid)<m){
r=mid;
}
else{
l=mid;
}
if(r-l<0.001){
break;
}
}
return l;
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a,a+n);
printf("%.2lf",f2(0,a[n-1]));
return 0;
}