#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;

class InParser
{
#pragma warning(disable:4996)
private:
    FILE* fin;
    char* buff;
    int sp;
    char read()
    {
        ++sp;
        if (sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }
public:
    InParser(const char* nume)
    {
        sp = 4095;
        buff = new char[4096];
        fin = fopen(nume, "r");
    }
    InParser& operator >> (int& n)
    {
        char c;
        while (!isdigit(c = read()));
        n = c - '0';
        while (isdigit(c = read()))
            n = n * 10 + c - '0';
        return *this;
    }
};
InParser fin("grupuri.in");
ofstream fout("grupuri.out");

const int NMAX = 100002;

int a[NMAX], n, k;

bool check(int val)
{
    unsigned long long s = 0;
    for (int i = n; i ; --i)
        s += min(val, a[i]);

    if (s / k >= val)
        return 1;
    return 0;
}

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

    for (int i = 1; i <= n; ++i)
        fin >> a[i];
    
    int r = 0, st = 1, dr = a[n];
    while (st <= dr)
    {
        int mij = (st + dr) >> 1;
        if (check(mij))
        {
            if (mij > r)
                r = mij;
            st = mij + 1;
        }
        else dr = mij - 1;
    }

    fout << r << "\n";

    fout.close();
    return 0;
}