#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, k, m;

bool can(int m, vector<int> & v){
    long long x = 0;
    for (int i = 0; i < n; ++i) {
        x += v[i] / m;
        if(x >= k) break;
    }
    return x >= k;
}

int main() {
    cin >> n >> k;
    vector <int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    int l = 0, r = v[n - 1] + 1;
    for (int j = 0; j < 1e4; ++j) {
        {
            m = l + (r - l) / 2;
            if (can(m, v)) l = m;
            else r = m;
        }
    }
    cout << m;
    return 0;
}