TLE了.......

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

int main() {
	long long n, m;
	cin >> n >> m;
	long long a[n];
	for (long long i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a, a + n);
	long long h = 0;
	long long j = 0, k = 1;
	while (m != 0) {
		for (long long i = 1; i < n - 1; i++) {
			if (a[n - 1] - a[i] > m) {
				a[i] += m;
				m = 0;
				break;
			} else {
				m -= (a[n - 1] - a[i]);
				a[i] += (a[n - 1] - a[i]);
			}
		}
		if (m > 0) {
			a[n - 1]++;
			m--;
		}
	}
	for (long long i = 1; i < n - 1; i++) {
		h += a[i];
	}
	cout << h;

	return 0;
}