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

int n,k,a[100001];

bool isok(int grupuri){
    long long int sum = 0;
    for(int i = 1;i<=n;i++){
        sum += min(grupuri, a[i]);
    }
    if(sum>=grupuri*1LL * k)return 1;
    return 0;
}

int main(void){
    ofstream cout("grupuri.out");
    ifstream cin("grupuri.in");
    cin >>k >> n;
    for(int i = 1;i<=n;i++){
        cin >> a[i];
    }
    int st = 0, dr = 1000000, mid = 9;
    while(st <= dr){
        mid = (st+dr) / 2;
        if(isok(mid)){
            st = mid+1;
        }else{
            dr = mid-1;
        }
    }
    cout << dr;
}