19_98

#include <bits/stdc++.h>

using namespace std;

int k, n, l, r, cnt;

int pos(int x, vector <int> &a) {
    long long m = x * k;

    for (int i = 0; i < n; ++i) {
        m -= min(x, a[i]);
    }

    if (m <= 0) {
        return true;
    }

    else {
        return false;
    }
}

int main ()
{
    cin >> k >> n;

    vector <int> a(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    l = 0, r = 1e9;

    while (r - l > 1) {
        int mid = (l + r) / 2;

        if (pos(mid, a)) {
            l = mid;
        }

        else {
            r = mid;
        }
    }

    cout << l;
}