#include <fstream>

using namespace std;

ifstream fin ("grupuri.in");
ofstream fout ("grupuri.out");

int k, n, i, st, dr, mid, v[100005];

long long s;

int main()
{
    fin >> k >> n;
    for (i=1; i<=n; i++){
        fin >> v[i];
        s += v[i];
    }
    st = 1;
    dr = s/k;
    while (st <= dr){
        mid = (st + dr)/2;
        s = 0;
        for (i=1; i<=n; i++){
            s += min (mid, v[i]);
        }
        if (s >= k*mid)
            st = mid + 1;
        else
            dr = mid - 1;
    }
    fout << dr;
    return 0;
}