#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[10000];
int m;
int judge(int mid,int n)
{
int t=1;
int i;
for(i=1;i<=m;i++)
t+=(int)(a[i]/mid);
if(t>n)
return 0;
else return 1;
}
int main()
{
double sum=0;
int n;
double c;
scanf("%d%d",&m,&n);
int i;
int maxn=0;
for(i=1;i<=m;i++)
{
scanf("%lf",&c);
a[i]=(int)(c*100+0.5);
if(a[i]>maxn)
maxn=a[i];
sum+=a[i];
}
sort(a+1,a+1+m);
int l=0;
int r=maxn+1;
int mid;
while(l+1<r)
{
mid=(l+r)/2;
if(judge(mid,n)==0)l=mid;
else r=mid;
}
double ans=(double)(l)/100;
if(ans>sum)
cout<<0.00<<endl;
else
printf("%.2lf",ans);
return 0;
}