#include "optimization.h"

using namespace std;

int main() {
#ifdef DEBUG
    assert(freopen("test.txt", "r", stdin));
#endif
    int n = readInt();
    int k = readInt();
    int rope[n];
    int sum = 0;

    for (int i = 0; i < n; i++) {
        rope[i] = readInt();
        sum += rope[i];
    }

    sum = sum / n;

    int left = 0;
    int right = sum;

    while (right - left > 1) {
        int middle = (left + right) / 2;
        int cnt = 0;
        for (int i = 0; i < n; i++) {
            cnt += rope[i] / middle;
        }
        if (cnt >= k) left = middle;
        else right = middle;
    }

    writeInt(left);
    return 0;
}