///   InfoAerena ~~ Grupuri

#include <fstream>

using namespace std;

ifstream in("grupuri.in");
ofstream out("grupuri.out");

typedef long long I64;

const int NMAX = 100000;
const int INF  = 1000000;

int v[NMAX+1];
I64 N, K, Sol;

bool Good( int val ) {
    I64 Sum = 0;
    for( int i = 1;  i <= N && Sum < val*K;  ++i ) {
        Sum += min( v[i], val );
    }
    return (Sum >= val*K);
}

int main() {
    in >> K >> N;
    for( int i = 1;  i <= N;  ++i )  in >> v[i];
    int step, i;
    for( step = 1;  step*2 < INF;  step<<= 1 );
    for( i = 0;  step;  step>>= 1 ) {
        if( Good(i+step) ) i += step;
    }
    Sol = i;
    out << Sol << '\n';
    return 0;
}