#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("grupuri.in");
ofstream cout("grupuri.out");
long long i, j, n, m, st, dr, a, b, nr, mid, k;
long long v[100005];

int adv(long long nr){
    long long s=0;
    for(int i=1;i<=n;i++){
        if(v[i]>nr)
            s+=nr;
        else
            s+=v[i];
    }
    if(s/nr>=k)
        return 1;
    else
        return 0;

}
int main() {
    cin>>k>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];

    st=0;
    dr=100000000000;

    while(st<=dr){
        long long mid=(st+dr)/2;
        if(adv(mid)){
            nr=mid;
            st=mid+1;
        }
        else{
            dr=mid-1;
        }
    }
    cout<<nr;



}