题目描述
blablabla
样例
blablabla
算法1
(暴力枚举) $O(n^2)$
include[HTML_REMOVED]
using namespace std;
define int long long
int n, m, c[55], maxn;
bool judge(int x){
int sum = 0;
for(int i = 1; i <= n; i ){
if(c[i] < x) sum += (x - c[i]);
}
return (sum <= min(x, m));
}
signed main(){
scanf(“%lld %lld”, &n, &m);
for(int i = 1; i <= n; i ){
scanf(“%lld”, &c[i]);
maxn = max(maxn, c[i]);
}
int l = 0, r = maxn + m;
while(l < r){
int mid = (l + r + 1) >> 1;
if(judge(mid)){
l = mid;
}else{
r = mid - 1;
}
}
printf(“%lld\n”, l);
return 0;
}
时间复杂度
参考文献
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度
参考文献
C++ 代码
blablabla