#include <iostream>
#include <cstdio>

using namespace std;

int n,k;
long long a[100005];

bool ok(long long val){
    long long s = 0;
    for(int i = 0; i < n; ++i)
        s+=min(a[i],val);
    if(s>=val*k)
        return 1;
    return 0;
}

int main()
{
    freopen("grupuri.in","r",stdin);
    freopen("grupuri.out","w",stdout);

    scanf("%d%d", &k,&n);
    for(int i = 0; i < n; ++i)
        scanf("%d", &a[i]);

    long long st = 1, dr = 100000000000, mij;
    while(dr-st>1){
        mij = (st+dr)/2;
        if(!ok(mij))
            dr=mij;
        else
            st = mij;
    }

    cout<<st;

    return 0;
}