打了好几次了，一直没过，请大佬帮忙看看

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m;
int a[N];

bool check(int h) {
	long long tot = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i] > h) {
			tot += a[i] - h;
		}
	}
	return tot >= m;
}

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	int l = 0, r = 4e5, ans;
	while (l <= r) {
		int mid = l + r >> 1;
		if (check(mid)) {
			ans = mid;
			l = mid + 1;
		} else {
			r = mid - 1;
		}
			printf("%d", &ans);
	}

	return 0;
}