#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("grupuri.in");
ofstream fout ("grupuri.out");
int k,n;
long long a[100001];
int main()
{
    fin >>k>>n;
    for (int i=1;i<=n;i++)
        {fin >>a[i];}
    long long left=1,right=100000000000,sol=0;
    while (left<=right)
          {long long mid=(left+right)/2,s=0;
           for (int i=1;i<=n;i++)
               {s=s+min(mid,a[i]);}
           if (s>=mid*k) {sol=mid;
                          left=mid+1;}
           else {right=mid-1;}}
    fout <<sol;
    return 0;
}