0
已解决
#include<iostream>
using namespace std;
long long n,m,a[100005],maxn=0;
bool c(int x){
int cnt=0;
for(int i=1;i<=n;i++){
cnt+=a[i];
}
return cnt>=m;
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
maxn=max(maxn,a[i]);
}
int l=0,r=maxn,ans;
while(l<=r){
int mid =(l+r)/2;
if(c(mid)){
ans=mid;
l=mid+1;
}else{
r=mid-1;
}
}
cout<<ans;
return 0;
}
