#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("grupuri.in");
ofstream out("grupuri.out");
long long v[100001], n, k;
bool SeFormeaza(long long g)
{
    long long x=0;
    for(int i=1; i<=n; i++)
    {
        if(v[i]<=g)
            x+=v[i];
        else
            x+=g;
    }
    return (g*k<=x);
}
int main()
{
    long long st=0, dr=1000000000, g;
    in>>k>>n;
    for(int i=1; i<=n; i++)
    {
        in>>v[i];
    }
    int r=0;
    while(st<=dr)
    {
        g=(st+dr)/2;
        if(SeFormeaza(g)==1)
        {
            r=g;
            st=g+1;
        }
        else
        {
            dr=g-1;
        }
    }
    out<<r;
}