#include <bits/stdc++.h>
using namespace std;

long long v[100001];
int n,k;

bool ok(long long x)
{
    int S=0;
    int i;
    for(i=1;i<=n;i++)
    {
        S+=min(v[i],x);
    }
    if(S>=x*k)
        return 1;
    else return 0;
}
int main()
{
    int i;
    freopen("grupuri.in","r",stdin);
    freopen("grupuri.out","w",stdout);
    scanf("%d %d",&k,&n);
    long long s=0;
    for(i=1;i<=n;++i)
    {
        scanf("%lld",&v[i]);
        s+=v[i];
    }
    long long sol;
    long long st=1,dr=s/k;
    while(st<=dr)
    {
        long long mid=(st+dr)/2;
        if(ok(mid)==1)
        {
         sol=mid;
         st=mid+1;
        }
        else
            dr=mid-1;
    }
    printf("%d",sol);
    return 0;
}