BZOJ 1816 扑克牌

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 55
using namespace std;
int n,m,c[maxn],l=0,r=0,ans;
bool check(int x)
{
int ret=min(m,x);
for (int i=1;i<=n;i++)
{
if (c[i]<x) ret-=(x-c[i]);
if (ret<0) return false;
}
if (ret>=0) return true;
return false;
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
scanf("%d",&c[i]);
l=1;r=1000000000;
while (l<=r)
{
int mid=l+r>>1;
if (check(mid)) {ans=mid;l=mid+1;}
else r=mid-1;
}
printf("%d\n",ans);
return 0;
}