#include <fstream>

using namespace std;

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

long long a[100001];

int main()
{
    long long k, n;
    in >> k >> n;
    for (long long i=1; i<=n; i++)
        in >> a[i];
    long long l=1, r=1e8;
    long long mid;
    while (l+1<r)
    {
        mid = (l+r)/2;
        long long sum = 0;

        for (long long i=1; i<=n; i++)
            sum += min (a[i], mid);
        if (sum < k*mid)
            r = mid;
        else
            l = mid;
    }
    out << l;
    return 0;
}