就离谱 rt

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

long long n, hw, arr[1000050], height;

long long func(long long x)
{
	long long fin=0;
	for (long long i = 0; i <= n-1; i++)
	{
		if (arr[i] > x)
			fin += arr[i]-x;
	}
	return fin;
}

int main()
{
	scanf("%lld%lld", &n, &hw);
	for (long long i = 0; i <= n-1; i++)
		scanf("%lld", &arr[i]);
	sort(arr, arr+n);
	long long l, r = arr[n-1], mid;
	while (l <= r)
	{
		mid = (l+r)/2;
		if (func(mid) < hw) r = mid-1;
		else l = mid+1;
	}
	printf("%lld", r);
	return 0;
}

各位大佬想想方法吧qwq本蒟蒻实在搞定不了