Abandoned warehouse

#include <iostream>
#include <vector>
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<long long> b(n);
  long long hi = 0;
  for (long long &x : b) {
    cin >> x;
    hi = max(hi, x);
  }

  long long lo = 0;
  while (lo < hi) {
    long long t = lo + (hi - lo + 1) / 2;
    long long give = 0, need = 0;
    for (long long x : b) {
      if (x > t) give += (x - t) / 2;
      else need += t - x;
    }
    if (give >= need) lo = t;
    else hi = t - 1;
  }

  cout << lo << "\n";
  return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER