#include<fstream>
#include<map>
#include<string>
#include<algorithm>
#include<climits>
using namespace std;
ifstream fin("grupuri.in");
ofstream fout("grupuri.out");
int main(){
int k,n,i,v[100002],st,dr,mij,rez;
long long sum=0,s=0;
fin>>k>>n;
for(i=1;i<=n;i++){
fin>>v[i];
sum+=v[i];
}
st=1;
dr=sum;
while(st<=dr){
    mij=(st+dr)/2;
    for(i=1,s=0;i<=n;i++)
        s+=min(v[i],mij);
    if(s>=1ll*mij*k){
        rez=mij;
        st=mij+1;
    }
    else
        dr=mij-1;
}
fout<<rez;
}