题目

洛谷P2440

只有12分，哪位大佬帮忙看下qwq

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m,k,a[N],maxi;
bool check(int x) 
{
	long long sum = 0;
	for(int i = 1; i <= n; i++)
		if(a[i] > x)
			sum += a[i] - x;
	return sum >= m;
}
int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		maxi = max(maxi, a[i]);
	}
	int lt = 0, rt = maxi + 1;
	while(lt + 1 < rt)
	{
		int mid = (lt + rt) / 2;
		if(check(mid)==true)
			lt=mid;
		else
			rt=mid;
	}
	cout<<lt;
	return 0;
}