#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>

#define BUF_SIZE 16384
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline int nextnum(){
    int a=0;
    char c=nextch();
    while(c<'0' || c>'9')
        c=nextch();
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a;
}

int v[100000], n, k;
inline int sol(long long ngrup){
    long long s=0;
    for(int i=0;i<n;i++)
        if(1LL*v[i]<ngrup)
            s+=v[i];
        else
            s+=ngrup;
    if(s>=ngrup*k)
        return 1;
    return 0;
}

int main(){
    FILE*fo;
    fi=fopen("grupuri.in","r");
    fo=fopen("grupuri.out","w");
    k=nextnum();
    n=nextnum();
    long long sum=0LL;
    for(int i=0;i<n;i++){
        v[i]=nextnum();
        sum+=1LL*v[i];
    }
    long long st=1, dr=sum/k;
    while(dr-st>1){
        long long mij=(st+dr)/2;
        if(sol(mij))
            st=mij;
        else
            dr=mij-1;
    }
    if(sol(dr))
        fprintf(fo,"%lld", dr);
    else
        fprintf(fo,"%lld", st);
    fclose(fi);
    fclose(fo);
    return 0;
}