#include <iostream>
#include <algorithm>
using namespace std;
long long n,k,a[100010];
long long P(int x){
    int res = 0;
    for (int i = 1;i <= n;i++) if(a[i] >= x) res += a[i] / x;
    return res;
}
int main(){
    cin >> n >> k;
    for (int i = 1;i <= n;i++) cin >> a[i];
    sort(a+1,a+n+1);
    long long L = 0,R = 1e8,mid,ans;
    while (L <= R){
        mid = (L + R) / 2;
         if (P(mid) >= k){
             ans = mid;
             L = mid + 1;
         }
         else R = mid - 1;
    }
    cout << ans;
}