#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,k,a[100005],st,dr,mij,rez;
bool verif(int x){
    int sum=0;
    for(int i=1;i<=n;++i){
        sum+=min(x,a[i]);
    }
    return(sum/k>=x);
}
int main()
{
    freopen("grupuri.in","r",stdin);
    freopen("grupuri.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>k>>n;
    for(int i=1;i<=n;++i) cin>>a[i];
    st=1;
    dr=1e9;
    while(st<=dr){
        mij=(st+dr)/2;
        if(verif(mij)){
            st=mij+1;
            rez=mij;
        }
        else{
            dr=mij;
        }
    }
    cout<<rez;
    return 0;
}