A. Elections
题目链接 : codeforces 1043A
题意:
给n个数,要求最小的数ans ,要求 n个数的和小于 n*ans - n个数的和。ans 最小为n个数 中最大的那个
题解:
暴力求就可以了
c++
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, ans = 0, sum = 0;
cin >> n;
for(int i = 1; i <= n; i++){
int t;
cin >> t;
ans = max(ans, t);
sum += t;
}
while(ans * n - sum <= sum){
ans++;
}
cout << ans << endl;
return 0;
}
php
<?php
$cin = fopen("php://stdin", "r");
$n = intval(fgets($cin));
$s = fgets($cin);
$a = explode(" ", $s);
$sum = 0;
$ans = 0;
for($i = 0; $i < count($a); $i++){
$sum += intval($a[$i]);
$ans = max($ans, intval($a[$i]));
}
while($ans * $n - $sum <= $sum){
$ans++;
}
print_r($ans."\n");
?>