#include <fstream>
#include <algorithm>

using namespace std;

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

long long n, a[100005], k, maxi;

int main()
{
    f >> k >> n;
    for(int i = 1; i <= n; i ++)
    {
        f >> a[i];
        maxi = max(maxi, a[i]);
    }

    long long st = 1, dr = maxi * n, poz = 0;
    while(st <= dr)
    {
        long long mij = (st + dr) / 2;

        long long sumi = 0;
        for(int i = 1; i <= n; i ++)
            sumi += min(mij, a[i]);

        if(sumi >= k * mij)
            st = mij + 1, poz = mij;

        else
            dr = mij - 1;
    }

    g << poz;
    return 0;
}