#include<bits/stdc++.h>
using namespace std;

int n,k;
double a[10005],l,r,mid;

bool check(double x){
    int addn = 0;
    for(int i = 1;i <= n;i ++) addn += floor(a[i] / x);
    return addn >= k;
}

int main(){
    cin >> n >> k;
    for(int i = 1;i <= n;i ++){
    	cin >> a[i];
    	r += a[i];
	}
    while(r - l > 1e-4){
        mid = (l + r) / 2;
        if(check(mid)) l = mid;
        else r = mid;
    }
    printf("%.2lf",l);
    return 0;    
}