100分求优化（必关）

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[1000002];
int check(int mid,int n,int a[])
{ 
	int m = 0;
  	for(int i = 1;i<=n;i++)
	{
		if(a[i] > mid)
		{
			m += a[i]-mid;
		}
	}
	return m;
}
signed main()
{
	int n,h,l,r,p,q;
	int mid = 0;
	l = 0;
	r = 0;
	cin>>n>>h;
	for(int i = 1;i<=n;i++)
	{
	    scanf("%d",&a[i]);
		r = r + a[i];
	}
	sort(a,a+n+1);
	while(l<r)
	{
		mid = (l+r+1)/2;
		p=check(mid,n,a);
		q=check(mid+1,n,a);
		if(p>h && q<h)
		{
			cout<<mid;
			break;
		}
		else if(p>h&&q>h)
		{
			l=mid;
		}
        else if(q == h)
        {
            cout<<mid+1;
            break;
        }
		else if(p<h)
		{
			r=mid;
		}
		else if(p==h)
		{
			cout<<mid;
			break;
		}
		
	}
    return 0;
}