#include <bits/stdc++.h>
using namespace std;

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

const int MAX = 1e5 + 5;

long long n, k, s;
long long v[MAX];

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

    int st = 1;
    int dr = s / k;
    int mij;
    while(st <= dr)
    {
        s = 0;
        mij = (st + dr) / 2;
        for(int i = 1; i <= n; ++i)
            s += min(mij * 1LL, v[i]);
        if(k * mij <= s)
            st = mij + 1;
        else
            dr = mij - 1;
    }
    g << dr;
    return 0;
}