#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
double INF = 1e10;
double EPS = 1e-10;
int MOD = 1e9+7;
vector<int> V;
ll countup(double len){
    ll cnt = 0;
    for(auto i:V){
        cnt += (ll)floor(1.*i / len);
    }
    return cnt;
}
main(){
   ll N,K;
   cin >> N;
   V.resize(N);
   rep(i,N)scanf("%d",&V[i]); 
   cin >> K;
   double ok = EPS,ng = INF;
   while(fabs(ok - ng) > EPS){
       double mid = (ok + ng) / 2;
       if(countup(mid) >= K)ok = mid;
       else                   ng = mid;
   }
   printf("%.9lf\n",ok);
}