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

int n, m, l, r, mid;
int a[100001];

bool check(int x){
	long long res(0);
	for (int i(1); i<=n; ++i) res += max(0, a[i]-x);
	return res >= m;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n >> m;
	for (int i(1); i<=n; ++i){
		cin >> a[i];
		r = max(r, a[i]);
	}
	
	while (l < r){
		mid = (l+r+1) >> 1;
		if (check(mid)) l = mid;
		else r = mid-1;
	}
	
	cout << l;
	
	return 0;
}