#include <iostream>
#include <map>
#include <algorithm>
#include <queue>

#define ll long long 
using namespace std;

const int N = 2e5 + 10;
double x[N],y[N]; 
int n,m;

bool ss(double a){
    int summ = 0;
    for(int i = 1; i <= n; i ++){
        if(x[i] / a) summ += (x[i] / a);
    }
    if(summ >= m) return 1;
    else return 0;
}

void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) cin >> x[i];
    double l = 0,r = 1e9;
    while(r - l >= 1e-3){
        double mid = (r + l) / 2.0;
        if(ss(mid)) l = mid;
        else r = mid;
    }
    printf("%.2lf\n",l);
}

int main(){
//  ll t;
//  cin >> t;
//  while(t --)
    solve();
    return 0;
}