#include <iostream>
#include <iomanip>
#include<algorithm>
#include <cmath>
#define int long long 
const int N = 1e6 + 10;
using namespace std;
int m, n, a[N], sum, ans, mid;
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++)cin >> a[i];
	sort(a + 1, a + 1 + n);
	int l = 1, r = a[n];
	while (l < r) {
		mid = l + (r - l) / 2;
		for (int i = n; i>=1&&a[i] > mid; i--) {
			sum += a[i] - mid;
		}
		if (sum == m) {
			cout << mid;
			return 0;
		}
		if (sum > m) {
			l = mid + 1;
		}
		else {
			r = mid - 1;
		}
		sum = 0;
	}
	cout << l;
	return 0;
}