#include<stdio.h>
int n,k,v[100000];
int checkpossible(int grupuri)
{
    int i;
    long long s=0;
    for(i=0;i<n;i++)
    {
        if(v[i]>grupuri)
            s+=grupuri;
        else
            s+=v[i];
    }
    long long x=grupuri,y=k;
    long long prod=x*y;
    if(s<prod)
        return 0;
    return 1;
}
int cautbin(int st,int dr)
{
    int lastgood,mij;
    while(st<dr)
    {
        mij=(st+dr)/2;
        if(checkpossible(mij)==0)
            dr=mij;
        else
        {
            lastgood=mij;
            st=mij+1;
        }
    }
    return lastgood;
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("grupuri.in","r");
    fout=fopen("grupuri.out","w");
    fscanf(fin,"%d%d",&k,&n);
    int i;
    long long s=0;
    for(i=0; i<n; i++)
    {
        fscanf(fin,"%d",&v[i]);
        s+=v[i];
    }
    fprintf(fout,"%d",cautbin(0,s/k+1));
    return 0;
}