二分查找`
#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
using namespace std;
const int maxn = 1e4+100;
double l[maxn];
int n , k;
bool check(double x)
{
int sum = 0;
for(int i=0;i<n;i++)
{
sum += int(l[i]/x);
}
return sum>=k;
}
int main()
{
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++) scanf("%lf",l+i);
double mi = 0,ma = 0x3f3f3f3f;
for(int i=0;i<100;i++)
{
double mid = (mi+ma)/2;
if(check(mid))mi = mid;
else ma = mid;
}
// cout << ma << " "<< mi<<endl;;
printf("%.2f\n",floor(ma*100)/100);
}