tj

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

int main(){
int n,m;
int tree[1000005];
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>tree[i];
}
int height=0;
for(int i=1;i<=n;i++){
if(tree[i]>height){
height=tree[i];
}
}
int left=0,right=height,mid,ans;
while(left<=right){
mid=(left+right)/2;
long long sum=0;
for(int j=1;j<=n;j++){
if(tree[j]>mid){
sum+=tree[j]-mid;
}
}
if(sum>=m){
ans=mid;
left=mid+1;
}else{
right=mid-1;
}
}
cout<<ans;
return 0;
}