盲蛋 (二分

添加链接描述
遇事不决先二分（不是
看到1e9先long long
其他没了

#include
using namespace std;
const int N=2e5+9;
#define int long long
int arr[N];
int n,k;
bool check(int mid){
    long long p=k;
    for(int i=n/2+1;i<=n;i++){
        if(mid>arr[i])
        p-=(long long)(mid-arr[i]);
        if(p<0)return 0;
    }
    return 1;
}
signed main(){
     
    scanf("%lld%lld",&n,&k);
    for (int i = 1; i <= n; i++)
    {     
        scanf("%lld",&arr[i]);
    }
    sort(arr+1,arr+1+n);
    int l=1 ,r=1e9+k;
    while(l>1;
        if(check(mid))l=mid;
        else r=mid-1;
    }
    cout<