1 #include<cstdio>
2 #include<iostream>
3
4 using namespace std;
5
6 int ans, n, k, a[10004], max_l;
7
8 inline void er_fen(){
9 int l = 1, r = max_l;
10 while(l <= r){
11 int cnt = 0;
12 int mid = (l + r) >> 1;
13 for(int i = 1; i <= n; i++){
14 cnt += a[i] / mid;
15 }
16 if(cnt >= k){
17 ans = max(ans, mid);
18 l = mid + 1;
19 }
20 else r = mid - 1;
21 }
22 }
23
24 int main(){
25 while(scanf("%d%d", &n, &k) != EOF){
26 max_l = -1, ans = 0;
27 for(int i = 1; i <= n; i++){
28 double len;
29 scanf("%lf", &len);
30 a[i] = len * 100;
31 max_l = max(max_l, a[i]);
32 }
33 er_fen();
34 printf("%.2f\n", (double) ans / 100.0);
35 }
36 return 0;
37 }
