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

#define rep(i, a, b) for (int i = a; i < b; i++)
using ll = long long;

int main(){
    int n, s;
    cin >> n >> s;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    sort(a.rbegin(), a.rend());
    ll l = 0, r = a[0];
    while(r - l > 1) {
        ll t = (l + r) / 2;
        ll sum = 0;
        for(int i = 0; i < n && a[i] > t; i += t) {
            sum += a[i];
            if(sum >= s) break;
        }
        if(sum < s) r = t;
        else l = t;
    }
    cout << r << endl;
}