#include <stdio.h>
#define DIM 100002

long long n,k,s,p,u,m,i,S;
long long A[DIM];

int merge(int x) {
  s = 0;
  for (i=1;(i<=n);i++) {
    if (A[i]<=x) s+=A[i];
    else s+=x;
  }
  if (s<k*x) return 0;
  else return 1;
}

int main(){
  FILE *f = fopen("grupuri.in","r");
  fscanf(f,"%lld %lld",&k,&n);
  for (i=1;i<=n;i++) {
    fscanf(f,"%lld",&A[i]);
    S+=A[i];
  }
  fclose(f);

  p=1;
  u=S/k+1;

  while (p<=u) {
    m=(p+u)/2;
    if (merge(m))
      p=m+1;
    else
      u=m-1;
  }
  FILE *g = fopen("grupuri.out","w");
  fprintf(g,"%lld",u);
  fclose(g);

  return 0;
}