#include <fstream>
using namespace std;
ifstream cin ("grupuri.in");
ofstream cout ("grupuri.out");
long long v[1000010];
int umplere(long long mijl,long long k,long long v[100010],long long n)
{
    long long s,i;
    s=0;
    for (i=1; i<=n; i++)
        if (v[i]>=mijl)
            s=s+mijl;
        else
            s=s+v[i];
    if (s>=mijl*k)
        return 1;///mai poate creste mijl
    return 2;///mijl tb sa scada
}
int main()
{
    long long k,n,st,dr,mijl,poz,i;
    cin>>k>>n;
    dr=0;
    for (i=1; i<=n; i++)
    {
        cin>>v[i];
        dr=dr+v[i];
    }
    st=1;
    dr=dr/k;
    while (st<=dr)
    {
        mijl=(st+dr)/2;
        if (umplere(mijl,k,v,n)==1)
        {
            st=mijl+1;
            poz=mijl;
        }
        else
            dr=mijl-1;
    }
    cout<<poz;
    return 0;
}