#include <bits/stdc++.h>
#define maxN 100006
using namespace std;
int n, x, k, v[maxN], i, j;
long long st, dr, mij;
long long sum;
bool valid(long long x)
{
    int i;
    long long s = 0LL;
    for(i = 1; i <= n; i++)
        if(v[i] < x) s += v[i];
        else s += x;
    if(s/k >= x) return true;
    return false;
}
int main()
{
    freopen("grupuri.in", "r", stdin);
    freopen("grupuri.out", "w", stdout);
    scanf("%d %d", &k, &n);
    for(i = 1; i <= n; i++)
        scanf("%d", &v[i]), sum += v[i];
    st=1, dr=sum;
    while(st <= dr)
    {
        mij = (st+dr)/2;
        if(valid(mij)) st = mij+1;
        else dr = mij-1;
    }
    printf("%lld", dr);
    return 0;
}