#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MP make_pair
#define SZ(X) ((int)(X).size())
typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 10;
int n,k;
double a[N],maxx;
double find(double l, double r) {
    const double eps = 1e-2;
    while(r - l > eps) {
        int sum = 0;
        double mid = (l + r) / 2;
        for(int i = 0;i < n;i ++) sum += int(a[i] / mid);
        if(sum >= k) l = mid;
        else r = mid;
    }
    return l;
}
int main(){
#ifdef LOCAL
   freopen("in.in","r",stdin);
   freopen("out.out","w",stdout);
#endif
//-----------------------------------------------------------------------------------------------------------------------------------
    cin >> n >> k;
    for(int i = 0;i < n;i ++) cin >> a[i],maxx = max(maxx,a[i]);
    double res = find(0, maxx);
    printf("%.2lf", floor(res * 100) / 100.00);
    return 0;
}