#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <algorithm>
#include <vector>
#include<cstdio>
#include<cstring>
#include<fstream>
#include <queue>

using namespace std;

#define NMax 100001

int cautbin(int v[], int n, int x)
{
	int i, pos = 1<<19;
	for (i = 0; pos != 0; pos = pos / 2)
	{
		if (i + pos <= n && v[i + pos] < x)
			i += pos;
	}
	return i+1;
}

/*inline int min (long long a, long long b)
{
    return a < b ? a : b ;
}
 
bool verif(long long x, int n, int v[])
{
    long long S = 0;
    for ( int i = 1; i < n+1; ++i )
            S += min( x, 1LL * v[i]);
 
    return S >= K * x * 1LL  ? true : false ;
}
 
long long bin_search (){
    long long sol=0, pow2 = 1LL*1<<32;
 
    while (pow2){
        if(verif(pow2+sol)) sol+= pow2;
        pow2>>=1;
    }
    return sol;
}
 */
#define NrMaxGr 1000000
int n, k, animale[NMax], s, maxim;
int verifica(int A[], int n, int nrGrup)
{
	s = 0;
	for (int i = 0; i < n; i++)
	{
		if ( A[i] > nrGrup )
		{
			s = s + nrGrup;
		}
		else
		{
			s = s + A[i];
		}
	}
	if (s >= nrGrup * k)
	{
		maxim = nrGrup;
		return 1;
	}
	return 0;
}

void cautare(int li, int ls)
{
	int m = (li + ls) / 2;
	if (verifica(animale, n, m) && li <= ls)
	{
		cautare(m+1, ls);
	}
	else
		if (li <= ls)
			cautare(li, m-1);
}
int main()
{
	FILE *f = fopen("source.txt", "r");
	FILE *g = fopen("text.txt", "w");
	fscanf(f, "%d %d", &k, &n);
	for (int i = 0 ; i < n; i++)
	{
		fscanf(f, "%d", &animale[i]);
	}
	
	cautare(0, NrMaxGr);

	fclose(f); fclose(g);
	return 0;
}