text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, tmp;
cin >> n;
vector<int> v(n);
int sum = 0, maxi = -1;
for (int i = 0; i < n; i++) {
cin >> tmp;
sum += tmp;
if (tmp > maxi) {
maxi = tmp;
}
v.at(i) = tmp;
}
int ans = 0;
for (int i = maxi; i <= 2 * maxi + 2; i++) {
int sum_tmp = 0;
for (int j = 0; j < n; j++) {
sum_tmp += (i - v.at(j));
}
if (sum_tmp > sum) {
ans = i;
break;
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[109], sum = 0, max = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > max) max = a[i];
sum = sum + a[i];
}
int t = max * n;
if (t - sum > sum) {
cout << max;
} else {
while (1) {
if (max * n - sum > sum) {
cout << max;
return 0;
} else
max++;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void die(long long x) {
cout << x << flush;
exit(0);
}
int n;
int sum, maxi, k;
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
sum += x;
maxi = max(maxi, x);
}
k = (2 * sum) / n + 1;
cout << max(k, maxi);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int dx4[] = {0, 0, -1, 1};
int dy4[] = {-1, 1, 0, 0};
int dx8[] = {0, 0, -1, 1, -1, -1, 1, 1};
int dy8[] = {-1, 1, 0, 0, -1, 1, -1, 1};
int knightx[] = {-1, 1, -2, 2, -2, 2, -1, 1};
int knighty[] = {-2, -2, -1, -1, 1, 1, 2, 2};
template <typename T>
T in() {
char ch;
T n = 0;
bool ng = false;
while (1) {
ch = getchar();
if (ch == '-') {
ng = true;
ch = getchar();
break;
}
if (ch >= '0' && ch <= '9') break;
}
while (1) {
if (ch < '0' || ch > '9') break;
n = n * 10 + (ch - '0');
ch = getchar();
}
return (ng ? -n : n);
}
template <typename T>
inline T POW(T B, T P) {
if (P == 0) return 1;
if (P & 1)
return B * POW(B, P - 1);
else
return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T Gcd(T a, T b) {
if (a < 0) return Gcd(-a, b);
if (b < 0) return Gcd(a, -b);
return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
if (a < 0) return Lcm(-a, b);
if (b < 0) return Lcm(a, -b);
return a * (b / Gcd(a, b));
}
template <typename T>
T Bigmod(T base, T power, T MOD) {
T ret = T(1) % MOD;
while (power) {
if (power & 1) ret = (ret * base) % MOD;
base = (base * base) % MOD;
power >>= 1;
}
return ret;
}
bool isVowel(char ch) {
ch = toupper(ch);
if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
return true;
return false;
}
template <typename T>
long long int isLeft(T a, T b, T c) {
return (a.x - b.x) * (b.y - c.y) - (b.x - c.x) * (a.y - b.y);
}
template <typename T>
T ModInverse(T number, T MOD) {
return Bigmod(number, MOD - T(2), MOD);
}
bool isConst(char ch) {
if (isalpha(ch) && !isVowel(ch)) return true;
return false;
}
int toInt(string s) {
int sm;
stringstream ss(s);
ss >> sm;
return sm;
}
bool isPrime(long long int val) {
if (val == 2) return true;
if (val % 2 == 0 || val == 1) return false;
long long int sqrt_N = (long long int)((double)sqrt(val));
for (long long int i = 3; i <= sqrt_N; i += 2) {
if (val % i == 0) return false;
}
return true;
}
template <class T>
string convert(T _input) {
stringstream blah;
blah << _input;
return blah.str();
}
bool valid(int r, int c, int x, int y) {
if (x >= 1 && x <= r && y >= 1 && y <= c) return 1;
return 0;
}
map<string, long long int> month;
void Month() {
month["January"] = 1, month["February"] = 2, month["March"] = 3,
month["April"] = 4, month["May"] = 5, month["June"] = 6;
month["July"] = 7, month["August"] = 8, month["September"] = 9,
month["October"] = 10, month["November"] = 11, month["December"] = 12;
}
bool Check(int val, int pos) { return bool(val & (1 << pos)); }
int Set(int val, int pos) { return val | (1 << pos); }
int Reset(int val, int pos) { return val & (~(1 << pos)); }
int Flip(int val, int pos) { return val ^ (1 << pos); }
long long int n, m, caseno, k, L;
long long int arr[109];
int main() {
long long int n;
long long int a = 0;
scanf("%lld", &n);
long long int mn = -1;
for (int i = 1; i <= n; i++) {
scanf("%lld", &arr[i]);
a += arr[i];
mn = max(mn, arr[i]);
}
for (long long int i = mn; i <= 2000; i++) {
long long int k = i;
long long int b = 0;
for (long long int j = 1; j <= n; j++) {
long long int t = k - arr[j];
if (t > 0) {
b += t;
}
}
if (b > a) {
printf("%lld", k), printf("\n");
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
map<ll, ll> mp1, mp;
vector<pair<ll, pair<ll, ll> > > vpp1;
vector<pair<ll, ll> > vp, vp1;
vector<ll> v, v1, v2, fin;
map<pair<ll, ll>, bool> mbb;
map<ll, bool> mb;
ll a, b, c, n, d, e, f, ta, sum = 0, cnt = 0, m, l, req, sz, maxi, k;
bool sortbysec(const pair<pair<ll, ll>, ll> &a,
const pair<pair<ll, ll>, ll> &b) {
return (a.second < b.second);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll ans = 0;
cin >> n;
ll arr[n + 10];
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
maxi = max(maxi, arr[i]);
sum += arr[i];
}
ll need = ((2 * sum) + (n - 1)) / n;
ans = max(need, maxi);
if ((ans * n) - sum <= sum) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
long long re[maxn];
long long k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
k = -1;
long long n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> re[i];
k = max(k, re[i]);
}
while (1) {
long long aw = 0, el = 0;
for (int i = 0; i < n; ++i) {
aw += k - re[i];
el += re[i];
}
if (aw > el) {
cout << k << '\n';
exit(0);
}
k++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};
const int drx[] = {2, 2, 1, 1, -1, -1, -2, -2};
const int dry[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int N = 400500;
int n, a[N], sum1, mx;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum1 += a[i];
mx = max(mx, a[i]);
}
if (n == 1) {
cout << mx * 2 + 1, exit(0);
}
for (int i = mx; i <= 100000; i++) {
int sum2 = 0;
for (int j = 1; j <= n; j++) {
sum2 += max(0, i - a[j]);
}
if (sum2 > sum1) {
cout << i, exit(0);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], i, j;
long long sum = 0;
int m = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
m = max(a[i], m);
}
for (i = m; i <= 250; i++) {
if (n * i - sum > sum) {
cout << i << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int sum = 0;
int x;
cin >> n;
int maxi = 0;
for (int i = 0; i < n; i++) {
cin >> x;
maxi = max(maxi, x);
sum = sum + x;
}
if (maxi * n > 2 * sum) {
cout << maxi << endl;
} else if ((2 * sum) % n == 0) {
cout << (2 * sum) / n + 1 << endl;
} else {
double q = (2 * sum) / (n + 0.0) + 0.0;
cout << ceil(q) << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
FILE *in, *out;
int N, M, K;
int ar[110];
int read() {
int i, j, k;
int x, y;
cin >> N;
x = 0;
y = 0;
for (i = 0, j = 0; i < N; i++) {
cin >> ar[i];
j = max(j, ar[i]);
y += ar[i];
}
while (1) {
x = 0;
for (i = 0; i < N; i++) {
x += j - ar[i];
}
if (x > y) {
cout << j << "\n";
return 0;
}
j++;
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
in = stdin;
out = stdout;
read();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, mx, sm, a[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
sm += a[i];
mx = max(mx, a[i]);
}
int l = mx, r = 2 * mx + 1, mid;
while (l < r) {
mid = (l + r) / 2;
if (mid * n > 2 * sm)
r = mid;
else
l = mid + 1;
}
printf("%d\n", l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr;
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
arr.push_back(a[i]);
sum += a[i];
}
sort(arr.begin(), arr.end());
int k = arr[arr.size() - 1];
int p;
for (int j = k;; j++) {
p = 0;
for (int i = 0; i < n; i++) {
p += (j - a[i]);
}
if (p > sum) {
cout << j;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, v = 0, s = 0, k, t;
vector<int> a;
int check(int k) {
s = 0;
for (int i = 0; i < n; ++i) {
s += k - a[i];
}
if (s > v)
return k;
else
check(k + 1);
}
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> t;
a.push_back(t);
v += t;
}
k = *max_element(a.begin(), a.end());
cout << check(k);
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void solve() {
long long int n;
cin >> n;
long long int a[n], sum = 0;
for (int(i) = (0); (i) < (n); ++(i)) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n, greater<int>());
long long int ans = a[0];
while (1) {
if ((ans * n) - sum > sum) {
cout << ans << "\n";
return;
} else
ans += 1;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, max;
max = 0;
cin >> n;
int a[n];
int f = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
f += a[i];
if (a[i] > max) max = a[i];
}
int k = max;
while (k * n - 2 * f <= 0) ++k;
cout << k << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e9 + 7;
const double PI = 3.1415926535;
void solve() {
int n;
cin >> n;
int Sum = 0, Max = 0;
for (int a = 0; a < n; a++) {
int in;
cin >> in;
Sum += in;
Max = max(Max, in);
}
int k = Sum * 2 / n;
k++;
if (k < Max) k = Max;
cout << k;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
solve();
cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, tot;
long long a[109];
inline bool check(long long mid) {
long long cnt = mid * n;
if (cnt > 2 * tot)
return true;
else
return false;
}
signed main() {
cin >> n;
for (long long i = 1; i < n + 1; ++i) cin >> a[i], tot += a[i];
long long l = *min_element(a + 1, a + n + 1), r = 100000;
while (r != l) {
long long mid = (l + r) >> 1;
if (check(mid))
r = mid;
else
l = mid + 1;
}
l = max(l, *max_element(a + 1, a + n + 1));
cout << l;
}
|
#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) {
while (b) b ^= a ^= b ^= a %= b;
return a;
}
void solve() {
int n;
int sum = 0, mx = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum += a;
mx = max(mx, a);
}
int total = sum * 2 + 1;
int av = total / n;
int ans = max(av, mx);
if (((ans * n) - sum) <= sum) ans++;
cout << ans << endl;
return;
}
int main() {
int tst = 1;
while (tst--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n, sum = 0, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
int max = a[0];
for (int i = 0; i < n; i++)
if (a[i] > max) max = a[i];
int k = max;
for (int i = 0; i < n; i++) count += k - a[i];
while (count <= sum) {
k++;
count = 0;
for (int i = 0; i < n; i++) count += k - a[i];
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp, sum = 0;
cin >> n;
int arr[n];
memset(arr, 0, sizeof(arr));
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
if (i == 0)
temp = arr[0];
else if (arr[i] > temp)
temp = arr[i];
}
while (((temp * n) - sum) <= sum) {
temp++;
}
cout << temp;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int sum = 0, x, maxn = 0;
for (int i = 1; i <= n; i++) scanf("%d", &x), maxn = max(maxn, x), sum += x;
for (int k = maxn;; k++) {
if (k * n - sum > sum) return 0 * printf("%d\n", k);
}
}
|
#include <bits/stdc++.h>
using namespace std;
namespace task {
int n, s, a, k;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
s += a;
k = max(k, a);
}
for (int i = k; i < 100000000; ++i) {
if (s < n * i - s) {
return cout << i << '\n', 0;
}
}
return 0;
}
} // namespace task
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.precision(11);
cout.setf(ios::fixed);
return task::main();
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, x, s, maax = 1 >> 30, res;
int main() {
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> x;
s += x;
maax = max(maax, x);
}
res = ceil(2 * s / n);
while (res * n <= 2 * s) res++;
if (res >= maax)
cout << res;
else
cout << maax;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int sum = 0, mx = 0;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
sum += x;
if (mx < x) mx = x;
}
printf("%d\n", max(2 * sum / n + 1, mx));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int mx = INT_MIN;
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
mx = max(a[i], mx);
s += a[i];
}
int i = 0;
for (i = mx;; i++) {
if ((i * n) > 2 * s) {
break;
}
}
cout << i << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
string letter = "URDL";
vector<pair<int, int>> mv = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};
int id(char c) { return letter.find(c); }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(17);
int n, k = 0;
cin >> n;
vector<int> a(n);
for (int i = 0; i < (n); i++) {
cin >> a[i];
k = max(a[i], k);
}
while (1) {
int c = 0;
for (int i = 0; i < (n); i++) {
c += k - 2 * a[i];
}
if (c > 0) {
break;
}
k++;
}
cout << k << endl;
;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0;
cin >> n;
vector<int> v;
while (n--) {
int a;
cin >> a;
v.push_back(a);
sum += a;
}
sort(v.begin(), v.end());
int temp = v[v.size() - 1];
bool done = false;
while (!done) {
int counter = 0;
for (int i = 0; i < v.size(); i++) counter += (temp)-v[i];
if (counter > sum)
done = true;
else
temp++;
}
cout << temp;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long TESTS = 1;
while (TESTS--) {
long long n;
cin >> n;
long long a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
long long s = 0;
sort(a, a + n);
for (long long int i = 0; i < n; i++) s += a[i];
cout << max(a[n - 1], (long long)floor((s * 2.0) / n + 1));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n;
int in;
int maxin = 1;
int acc = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> in;
acc += in;
maxin = max(maxin, in);
}
int res = max(acc * 2 / n + 1, maxin);
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
deque<int> v, vc, t;
int x, m, n, r, l, q, T, p, cnt = 0, mx, ans = 0, sum = 0, y, mn = 1e18;
map<long long, long long> mp;
string s, s1, g;
char xz;
int main() {
cin >> m;
for (int i = 0; i < m; i++) {
cin >> y;
ans += y;
v.push_back(y);
}
cnt = *max_element(v.begin(), v.end());
for (int i = 0; i < cnt * 4; i++) {
if (i >= cnt) {
for (int j = 0; j < v.size(); j++) {
sum += (i - v[j]);
}
if (sum > ans) return cout << i, 0;
sum = 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int arr[n], max = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
max = fmax(arr[i], max);
sum += arr[i];
}
sum *= 2;
sum++;
int rem = n - sum % n;
if (sum % n != 0) sum += rem;
sum /= n;
cout << fmax(sum, max) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0, n, k, max = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > max) max = a[i];
}
k = max;
while ((k * n) <= (2 * sum)) k++;
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 genrand(chrono::system_clock::now().time_since_epoch().count());
string inttostr(long long str) {
stringstream stream;
stream << str;
return stream.str();
}
string numtobin(long long n) {
string r = "";
while (n) r = ((n & 1) ? '1' : '0') + r, n >>= 1;
return r;
}
long long bintonum(string s) {
long long n = 0, p = 1 << (s.length() - 1);
for (char i : s) n += (i - '0') * p, p >>= 1;
return n;
}
long long modexpo(long long a, long long b, long long n) {
long long d = 1;
while (b) {
if (b & 1) d = (d * a) % n;
b >>= 1;
a = (a * a) % n;
}
return d;
}
long long expo(long long a, long long b) {
long long d = 1;
while (b) {
if (b & 1) d = d * a;
b >>= 1;
a = a * a;
}
return d;
}
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long inv(long long a, long long m) { return modexpo(a, m - 2, m); }
void take_input_and_output_from_file() {}
inline long long scan_int() {
long long NR = 0, sign = 1;
char c = getchar();
while (c < 48 || c > 57) {
if (c == '-') sign = 0;
c = getchar();
}
while (c > 47 && c < 58) {
NR = (NR << 3) + (NR << 1) + (c - 48);
c = getchar();
}
return (sign ? NR : (-NR));
}
int main() {
int n = scan_int();
int a[n], i;
for (i = 0; i < n; i++) a[i] = scan_int();
int k, ma = 0;
for (i = 0; i < n; i++) ma = max(ma, a[i]);
int sm = 0;
for (i = 0; i < n; i++) sm += a[i];
k = ma;
while (1) {
int sma = 0;
for (i = 0; i < n; i++) sma += k - a[i];
if (sma > sm) break;
k++;
}
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
while (cin >> n) {
vector<int> v;
int sum = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
sum += p;
v.push_back(p);
}
sort(v.begin(), v.end());
int p = v[n - 1];
int x = 0;
for (int i = 0; i < n; i++) {
x += p - v[i];
}
if (x > sum) {
cout << p << endl;
} else {
int s = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
s += p - v[i];
if (i == n - 1) {
if (s > sum) {
cnt = 1;
} else {
p += 1;
i = -1;
s = 0;
}
}
if (cnt == 1) break;
}
cout << p << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ma, tot;
int ta;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &ta);
ma = max(ma, ta);
tot += ta;
}
ma = max(ma, 2 * tot / n + 1);
printf("%d\n", ma);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int oo = 1e9 + 5;
const int N = 1e5 + 5;
int ans = 0;
int main() {
int n;
cin >> n;
int a[n], mx = -N;
for (int(i) = (0); (i) < (n); i++) {
cin >> a[i];
if (a[i] > mx) mx = a[i];
ans += a[i];
}
ans = (ans * 2) + 1;
if (ans % n)
ans = (ans / n) + 1;
else
ans = (ans / n);
cout << max(ans, mx) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
int suma = 0;
int maxi = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
suma += a[i];
maxi = max(maxi, a[i]);
}
int sumb = 0;
for (int i = 1; i <= n; i++) {
sumb += maxi - a[i];
}
while (sumb <= suma) {
sumb += n;
maxi++;
}
cout << maxi << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
static const string YES = "YES", NO = "NO";
int main() {
int n;
cin >> n;
int sum = 0;
int MAX = -1;
int x;
for (int i = (0); i < (n); ++i) {
cin >> x;
sum += x;
MAX = max(x, MAX);
}
int result = max(MAX, 2 * sum / n + 1);
cout << result;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, a, sum = 0, max = -1;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a;
sum += a;
max = (a > max ? a : max);
}
while (max * n - 2 * sum <= 0) max++;
cout << max;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> A(100);
bool f(int m) {
int k1 = 0, k2 = 0;
for (int i = 0; i < n; i++) {
k1 += A[i];
k2 += m - A[i];
}
if (k2 > k1)
return true;
else
return false;
}
int main() {
cin >> n;
int MAX = -1;
for (int i = 0; i < n; i++) {
cin >> A[i];
if (A[i] > MAX) MAX = A[i];
}
int l = MAX - 1, r = 201;
while (r - l > 1) {
int m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
cout << r;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max_v;
int sum, base;
cin >> n;
sum = max_v = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
sum += x;
max_v = max(max_v, x);
}
base = max_v * n - sum;
int d = sum - base;
int k = (sum < base ? max_v : max_v + d / n + (d % n > 0));
while (k * n - sum <= sum) k++;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
cin >> n;
double sum = 0;
int a, best = 0;
for (int i = 0; i < n; ++i) cin >> a, sum += 2 * a, best = max(best, a);
if (sum / n == ceil(sum / n))
sum = sum / n + 1;
else
sum = ceil(sum / n);
cout << max(best, int(sum)) << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, total = 0;
cin >> n;
int m = 0;
for (int i = 0; i < n; i++) {
cin >> a;
total += a;
m = max(m, a);
}
while (true) {
int t = n * m;
if (t - total > total) {
cout << m << endl;
return 0;
}
m += 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int Lpow(long long int a, long long int b) {
long long int ans = 1;
while (b > 0) {
if (b % 2) ans = (ans * a);
a = (a * a);
b = b / 2;
}
return ans;
}
long long int gcd(long long int a, long long int b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int n;
cin >> n;
vector<int> arr(n);
int ma = 0;
int x;
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> x;
sum += x;
ma = max(ma, x);
}
int l = ma;
int r = 250;
while (l < r) {
int mid = (l + r) / 2;
int now = mid * n - sum;
if (now > sum)
r = mid;
else
l = mid + 1;
}
cout << l << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, sum = 0;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i];
sort(a + 1, a + 1 + n);
for (int i = a[n];; i++) {
int cnt = i * n;
if (cnt > 2 * sum) {
cout << i << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s = 0, x, m = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
m = max(m, x);
s += x;
}
cout << max(m, 2 * s / n + 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int x, y;
y = scanf("%d", &x);
return x;
}
int main() {
int n = in();
int s = 0, m = 0;
for (int i = 0; i < n; i++) {
int nb = in();
s += nb;
m = max(nb, m);
}
std::cout << max(m, (2 * s) / n + 1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
b = v[n - 1];
int s = 0;
for (int i = 0; i < n; i++) s = s + v[i];
if (((s * 2) + 1) % n == 0)
cout << max(b, ((s * 2) + 1) / n);
else
cout << max(b, (((s * 2) + 1) / n) + 1);
}
|
#include <bits/stdc++.h>
using namespace std;
long long INFLL = (long long)4e18, MOD = 1e9 + 7;
const int INF = 0x3f6f6f6f;
vector<vector<int> > adj;
vector<int> vis, color, level, temp_color;
int dx8[] = {0, 1, 1, 1, 0, -1, -1, -1}, dy8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
inline long long mexp(long long x, long long n, long long m = MOD) {
long long res = 1;
x %= m;
while (n) {
if (n & 1) res = (res * x) % m;
n >>= 1;
x = (x * x) % m;
}
return res;
}
inline bool ispow2(long long x) { return x && (!(x & (x - 1))); }
inline long long gcd(long long a, long long b) {
while (a > 0 && b > 0) {
if (a > b)
a %= b;
else
b %= a;
}
return a + b;
}
int32_t main(void) {
cout << fixed;
cerr << fixed;
cout << setprecision(10);
cerr << setprecision(3);
mt19937 genr(chrono::high_resolution_clock::now().time_since_epoch().count());
int n;
cin >> n;
long long sum = 0, mx = -1;
for (int i = 0; i < n; ++i) {
long long t;
cin >> t;
mx = max(mx, t);
sum += t;
};
;
cout << max(mx, (long long)ceil((2 * sum) / n) + 1) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long i, j, k, n, x, sum, mx, a[100009];
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
mx = max(mx, a[i]);
}
while (1) {
long long sum1 = 0;
for (i = 0; i < n; i++) sum1 += mx - a[i];
if (sum1 > sum) {
cout << mx << endl;
return 0;
}
mx++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, s = 0, s1 = 0, max = 0;
cin >> n;
long long int a[n], b[n];
for (i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
if (a[i] > max) max = a[i];
}
long long int k = max;
while (1) {
s1 = 0;
for (i = 0; i < n; i++) {
b[i] = k - a[i];
s1 += b[i];
}
if (s1 > s) {
cout << k;
break;
}
k++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, m, n, p, s;
cin >> n;
int a[n];
for (i = 0, s = 0, m = 0; i < n; i++) {
cin >> a[i];
s = s + a[i];
if (a[i] > m) m = a[i];
}
s = s + 1;
for (i = 0, p = 0; i < n; i++) {
p = p + m - a[i];
}
if (p >= s) {
cout << m;
return 0;
} else {
p = s - p;
if (p % n)
p = (p / n) + 1;
else
p = (p / n);
cout << m + p;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int a[MAXN], N;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) scanf("%d", a + i);
int mxa = 0, sa = 0;
for (int i = 0; i < N; i++) sa += a[i], mxa = max(mxa, a[i]);
printf("%d\n", max((sa * 2 + N) / N, mxa));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout.sync_with_stdio(0);
cin.tie(0);
long long n;
cin >> n;
vector<long long> v;
long long maxi = 0;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
maxi = max(maxi, x);
v.push_back(x);
}
long long esq = maxi, dir = 1e9, res = 1e9;
while (esq <= dir) {
long long mid = (esq + dir) / 2;
long long a = 0;
for (long long i = 0; i < n; i++) a += mid - v[i];
long long b = mid * n - a;
if (a > b) {
dir = mid - 1;
res = min(res, mid);
} else
esq = mid + 1;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e9 + 7;
const double pi =
3.14159265358979323846264338327950288419716939937510582097494459;
const int N = 5e5 + 5;
const int oo = 1e9 + 7;
const long long OO = 1e18;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> vec(n);
int sum = 0, maxi = 0;
for (int i = 0; i < n; i++) {
cin >> vec[i];
maxi = max(maxi, vec[i]);
sum += vec[i];
}
for (int k = maxi; k <= 201; k++) {
int s = 0;
for (int i = 0; i < n; i++) s += (k - vec[i]);
if (s > sum) {
cout << k << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int TOTAL, SUM = 0, Z, MAX = 0, VOTE;
cin >> TOTAL;
for (Z = 0; Z < TOTAL; Z++) {
cin >> VOTE;
SUM = SUM + VOTE;
if (VOTE > MAX) {
MAX = VOTE;
}
}
while (1) {
if (MAX * TOTAL - SUM > SUM) {
cout << MAX;
break;
}
MAX++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int maxi = INT_MIN;
int arr[105];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
maxi = max(maxi, arr[i]);
}
int k = maxi;
while (k * n - sum <= sum) {
k++;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int brr[n];
int max = 0;
int sum1 = 0;
int sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
if (arr[i] > max) {
max = arr[i];
}
sum1 += arr[i];
}
for (int i = 0; i < n; i++) {
sum2 += (max - arr[i]);
}
while (sum2 <= sum1) {
max++;
sum2 += n;
}
cout << max;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long binpow(long long a, long long b) {
a = a % 1000000007;
long long res = 1;
while (b > 0) {
if (b & 1) res *= a % 1000000007;
a = a * a % 1000000007;
b = b >> 1;
}
return res;
}
void speedup() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int main() {
speedup();
int n;
cin >> n;
int sum = 0;
int k;
int ma = 0;
for (int i = 0; i < n; i++) {
cin >> k;
sum += k;
ma = max(ma, k);
}
sum = 2 * sum + 1;
int j = ceil((double)sum / n);
cout << max(ma, j) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, i, j;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
;
long long sum = 0, maxi = 0;
for (i = 0; i < n; i++) {
maxi = max(maxi, a[i]);
sum += a[i];
}
for (i = maxi; i <= 1000; i++) {
long long c = 0;
for (j = 0; j < n; j++) c += i - a[j];
if (c > sum) {
cout << i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long sz = 1000007;
template <typename... T>
void read(T&... args) {
((cin >> args), ...);
}
template <typename... T>
void write(T&&... args) {
((cout << args << " "), ...);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, mx = INT_MIN;
read(n);
long long Elodreip(0), need(0);
vector<int> lst;
for (int i = 1, val; i <= n; ++i)
cin >> val, lst.push_back(val), mx = max(mx, val), Elodreip += val;
while (true) {
need = 0;
for (int i = 0; i < n; ++i) need += mx - lst[i];
if (Elodreip < need) return cout << mx << endl, 0;
++mx;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, sum1 = 0, sum2 = 0;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
sum1 += v[i];
}
auto it = max_element(v.begin(), v.end());
for (int i = *it; i < 10000; i++) {
sum2 = 0;
for (int j = 0; j < n; j++) sum2 = sum2 + (i - v[j]);
if (sum2 > sum1) {
cout << i << "\n";
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int thuan(long a[], long n, long m) {
int s = 0;
for (int i = 0; i < m; i++) {
s = s + n - a[i];
}
return s;
}
int main() {
long max = 0, n;
cin >> n;
long a[n], s1 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] > max) {
max = a[i];
}
s1 = s1 + a[i];
}
while (1) {
if (thuan(a, max, n) <= s1) {
max++;
} else {
break;
}
}
cout << max;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n;
cin >> n;
long long int a[n];
long long int s = 0;
long long int m = INT_MIN;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
m = max(a[i], m);
}
cout << max(m, (2 * s / n + 1));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, ma = -1;
cin >> n;
int ar[n];
for (int i = 0; i < n; i++) {
cin >> ar[i];
sum = sum + ar[i];
ma = max(ma, ar[i]);
}
int res = 2 * sum / n;
res = max(res, ma);
if (n * res > 2 * sum) {
cout << res;
} else {
cout << res + 1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
long long int power(long long int a, long long int b) {
long long int value = 1;
while (b) {
if (b & 1) {
value *= a;
}
a *= a;
b /= 2;
}
return value;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
long long int a[n];
long long int mx = 0, sum = 0;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
mx = max(mx, a[i]);
sum += a[i];
}
long long int ans = 0;
for (long long int i = mx; i < 1000000; i++) {
if (i * n > 2 * sum) {
ans = i;
break;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, s = 0, ma = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int inp;
cin >> inp;
s += inp;
ma = max(ma, inp);
}
cout << max(ma, (2 * s + n) / n) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 1000005;
int SetBit(int n, int x) { return n | (1 << x); }
int ClearBit(int n, int x) { return n & ~(1 << x); }
int ToggleBit(int n, int x) { return n ^ (1 << x); }
bool CheckBit(int n, int x) { return (bool)(n & (1 << x)); }
int arr[105];
int main(void) {
int n, i, j, sum = 0, maxi = 0, add;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
sum += arr[i];
if (arr[i] > maxi) maxi = arr[i];
}
for (i = maxi;; i++) {
add = 0;
for (j = 0; j < n; j++) add += (i - arr[j]);
if (add > sum) {
printf("%d\n", i);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int a[n], flag = 0, count, b[n];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
flag = flag + a[i];
}
int max = a[0];
for (int i = 1; i < n; i++) {
if (max < a[i]) max = a[i];
}
for (int i = max; i <= 10000; i++) {
count = 0;
for (int j = 0; j < n; j++) {
b[j] = i - a[j];
count = count + b[j];
}
if (count > flag) {
printf("%d\n", i);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int *mas = new int[n];
int sum = 0;
int max = 0;
for (int i = 0; i < n; i++) {
cin >> mas[i];
sum += mas[i];
if (mas[i] > max) max = mas[i];
}
int k = max;
while ((k * n - sum) <= sum) {
k++;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize 03
using namespace std;
const int N = 101;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, a, j = 0, tot = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
j = max(a, j);
tot += a;
}
for (int i = j; i < 202; i++)
if (i * n > tot * 2) {
cout << i << endl;
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
long long int n;
cin >> n;
long long int a[n], max1 = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (max1 < a[i]) max1 = a[i];
sum2 += a[i];
}
while (1) {
long long int sum = 0;
for (int i = 0; i < n; i++) {
sum = sum + max1 - a[i];
}
if (sum > sum2)
break;
else
max1++;
}
cout << max1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, s = 0, j = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
if (a > j) {
j = a;
}
s = s + a;
}
s = s * 2;
s = s + n;
s = s / n;
if (s > j)
printf("%d", s);
else
printf("%d", j);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ar[101], sum = 0, opp = 0, ans = 0, mx = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> ar[i], sum += ar[i], mx = max(mx, ar[i]);
for (int i = 1; i <= 10001; i++) {
opp = 0;
for (int j = 0; j < n; j++) {
int x = max(0, (i - ar[j]));
opp += x;
}
if (opp > sum) {
ans = i;
break;
}
}
cout << max(ans, mx) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, a[20020], sum, k;
int main() {
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i], sum += a[i];
sort(a + 1, a + n + 1);
for (k = a[n]; k <= 201; k++) {
int now = 0;
for (i = 1; i <= n; i++) now += max(0, k - a[i]);
if (now > sum) {
cout << k << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
int main() {
std::ios::sync_with_stdio(false);
int n;
scanf("%d", &n);
int sum = 0, mxa = 0;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
sum += a;
mxa = std::max(mxa, a);
}
int opt_k = ceil(2.0 * sum / n);
if (opt_k == 2.0 * sum / n) opt_k++;
if (opt_k < mxa) opt_k = mxa;
printf("%d\n", opt_k);
return 0;
}
|
#include <bits/stdc++.h>
const int N = 150;
int a[N];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int k = 0;; ++k) {
int s1 = 0, s2 = 0;
bool fl = true;
for (int i = 0; i < n; ++i) {
s1 += a[i];
s2 += k - a[i];
if (k - a[i] < 0) {
fl = false;
}
}
if (!fl) {
continue;
}
if (s1 < s2) {
printf("%d\n", k);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, N = 1e6 + 7;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
long long gcd(long long x, long long y) { return (!y) ? x : gcd(y, x % y); }
long long lcm(long long x, long long y) { return ((x * y) / gcd(x, y)); }
void file() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int a[1005];
int main() {
file();
int n;
cin >> n;
int sum = 0, mx = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
mx = max(mx, a[i]);
sum += a[i];
}
for (int i = mx; i <= 10000; i++) {
int rem = 0;
for (int j = 0; j < n; j++) {
rem += i - a[j];
}
if (rem > sum) return cout << i << '\n', 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
{
long long int n;
cin >> n;
long long int a[n], i, j, k = INT_MIN, s = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
k = max(k, a[i]);
s += a[i];
}
j = k;
while (j > 0) {
long long int p = j * n;
long long int q = p - s;
if (q > s) {
break;
}
j++;
}
cout << j << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
int A[200];
int K;
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
K = 0;
for (int i = 0; i < N; i++) {
K = max(K, A[i]);
}
int T = 0;
for (int i = 0; i < N; i++) {
T += A[i];
}
T = 2 * T + 1;
K = max(K, (T + N - 1) / N);
cout << K << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, sum = 0, sum1 = 0;
cin >> n;
vector<int> mas(n);
for (int i = 0; i < n; i++) {
cin >> mas[i];
sum += mas[i];
}
int max = *max_element(mas.begin(), mas.end());
while (sum1 <= sum) {
sum1 = 0;
for (int i = 0; i < n; i++) {
sum1 += max - mas[i];
}
max++;
}
cout << max - 1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
bool check(int k, int n) {
int an1 = 0, an2 = 0;
for (int i = 0; i < n; i++) {
an1 += a[i];
an2 += (k - a[i]);
}
if (an2 > an1) {
return true;
}
return false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int i, j, k, l, m, n, t, r, cnt;
int flag = 0;
long long ans = 0, an = 0;
t = 1;
while (t--) {
cin >> n;
k = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
k = max(k, a[i]);
}
for (i = k; i <= 500; i++) {
if (check(i, n)) {
break;
}
}
cout << i << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
long long a[n];
long long maxa = 0;
long long suma = 0;
for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
i += 1 - 2 * ((0) > (n))) {
cin >> a[i];
if (a[i] > maxa) {
maxa = a[i];
}
suma += a[i];
}
long long k = (2 * suma) / n;
if (n * k <= (2 * suma)) {
k++;
}
cout << max(maxa, k);
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-ffloat-store")
#pragma GCC optimize("-fno-defer-pop")
long long int power(long long int a, long long int b, long long int m) {
if (b == 0) return 1;
if (b == 1) return a % m;
long long int t = power(a, b / 2, m) % m;
t = (t * t) % m;
if (b & 1) t = ((t % m) * (a % m)) % m;
return t;
}
long long int modInverse(long long int a, long long int m) {
return power(a, m - 2, m);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int i, j, k, l, n;
cin >> n;
long long int ar[n + 1], mx = 0;
for (i = 1; i <= n; i++) {
cin >> ar[i];
mx = max(mx, ar[i]);
}
long long int a, b, mid, an;
a = mx;
b = 1e10;
while (b >= a) {
mid = (a + b) / 2;
long long int v = 0, c = 0;
for (i = 1; i <= n; i++) {
v += ar[i];
c += (mid - ar[i]);
}
if (c > v) {
an = mid;
b = mid - 1;
} else {
a = mid + 1;
}
}
cout << an;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
{
cin.sync_with_stdio(0);
cout.sync_with_stdio(0);
cin.tie(0);
cout.tie();
}
{}
int n;
cin >> n;
int Min = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
sum += x;
Min = max(Min, x);
}
for (int i = Min;; i++) {
if (n * i - sum > sum) {
cout << i;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k = 1, sum = 0, e, i, j, max = 0;
scanf("%d", &n);
int ara[n];
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
if (ara[i] > max) max = ara[i];
sum = sum + ara[i];
}
k = max;
while (1) {
e = 0;
for (i = 0; i < n; i++) {
e = e + k - ara[i];
}
if (e > sum) break;
k++;
}
printf("%d", k);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int lar = -1;
int sum = 0, s = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
if (arr[i] >= lar) lar = arr[i];
}
while (1) {
s = 0;
for (int i = 0; i < n; i++) {
s += lar - arr[i];
}
if (s > sum) {
cout << lar;
break;
} else
lar++;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, s = 0, ms = 0, i, mx, k, a[10000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (!i)
k = a[i];
else if (a[i] > k)
k = a[i];
s += a[i];
}
k--;
while (ms <= s) {
k++;
ms = (n * k) - s;
}
printf("%d\n", k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int ms = 1e5 + 5;
int a[ms];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
int menor = 0;
cin >> n;
int soma = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
menor = max(x, menor);
soma += x;
}
for (int k = menor; true; k++) {
if (n * k > soma + soma) {
cout << k << endl;
return 0;
}
}
cout << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, max_1 = 0;
int a[105];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
max_1 = max(max_1, a[i]);
}
for (int i = max_1;; i++) {
if (n * i - sum > sum) {
cout << i << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7, N = 1e5 + 7, MOD = 998244353, M = 202;
int n, m;
long long inp[N];
int S;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> inp[i];
S += inp[i];
m = max((long long)m, inp[i]);
}
for (int k = m; k < 10000; ++k) {
if (n * k > 2 * S) {
cout << k;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum = 0;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
for (int i = a[n - 1];; i++) {
if (n * i - sum > sum) {
cout << i;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, sum = 0, mx = -1, resultK = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
mx = max(mx, x);
sum += x;
}
resultK = mx;
while (true) {
if (resultK * n - sum > sum) break;
resultK++;
}
cout << resultK;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 9;
const int N = 3e5 + 1;
int a[N], x[N];
int main() {
int i, j, k, n, l;
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
int y = 0;
for (i = 1; i <= n; ++i) {
cin >> a[i];
y = max(y, a[i]);
}
for (i = y; i <= 300; ++i) {
int bl = 0;
for (j = 1; j <= n; ++j) bl += a[j] - (i - a[j]);
if (bl < 0) {
cout << i;
return 0;
}
}
}
|
#include <bits/stdc++.h>
int main(int argc, const char* argv[]) {
int n;
std::cin >> n;
int sum = 0, max = -1;
for (int i = 0; i < n; i++) {
int t;
std::cin >> t;
max = std::max(max, t);
sum += t;
}
std::cout << std::max((2 * sum / n) + 1, max) << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n], mx = -1, sum = 0, sum1 = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
mx = max(mx, arr[i]);
sum += arr[i];
}
for (int i = 0; i < n; i++) {
arr[i] = mx - arr[i];
sum1 += arr[i];
}
int ans = mx;
while (sum1 <= sum) {
ans++;
sum1 += n;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int max = INT_MIN;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if (a[i] > max) max = a[i];
}
while (1) {
int sum1 = 0;
for (int i = 0; i < n; i++) {
sum1 += (max - a[i]);
}
if (sum1 > sum) {
cout << max;
break;
}
max++;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n;
long long a[N];
long long check(long long k) {
long long votes = 0;
for (long long i = 1; i <= n; i++) {
votes -= a[i];
votes += (k - a[i]);
}
return votes > 0;
}
long long binsearch(long long lo, long long hi) {
while (lo < hi) {
long long mid = (lo + hi) / 2;
if (check(mid))
hi = mid;
else
lo = mid + 1;
}
return lo;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (long long i = 1; i <= n; i++) cin >> a[i];
sort(a + 1, a + n + 1);
long long ans = binsearch(a[n], 1e9);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 105;
int N;
int a;
int amax;
int s1;
int k;
int main() {
cin >> N;
s1 = 0;
amax = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
amax = max(a, amax);
s1 += a;
}
k = (2 * s1) / N + 1;
k = max(k, amax);
cout << k << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
if (a[i] > max) max = a[i];
sum += a[i];
}
int ans = max;
while ((ans * n) - (2 * sum) <= 0) {
ans++;
}
cout << ans;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.