#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
std::uniform_int_distribution<std::mt19937::result_type> udist(0, 1);
std::mt19937 rng;
using namespace std;
FILE *in, *out;
int ri() {
  int a;
  fscanf(in, "%d", &a);
  return a;
}
double rf() {
  double a;
  fscanf(in, "%lf", &a);
  return a;
}
char sbuf[100005];
string rstr() {
  char c;
  char *b = sbuf;
  while (c = fgetc(in)) {
    if (c == '\n' || c == 255) break;
    *b++ = c;
  }
  *b = 0;
  return sbuf;
}
long long nod(long long a, long long b) {
  if (a == 1 || b == 1) return 1;
  if (a == 0) return b;
  if (b == 0) return a;
  return nod(b % a, a);
}
vector<int> primes;
void calculatePrimes() {
  primes.push_back(2);
  for (int i = 3; i < 100000; i += 2) {
    bool bFound = false;
    int m = (int)sqrt((float)i);
    for (int j = 1; j < primes.size() && !bFound && primes[j] <= m; j++)
      bFound = ((i % primes[j]) == 0);
    if (!bFound) primes.push_back(i);
  }
}
bool isPrime(int p) {
  for (int i : primes)
    if (p != i && (p % i) == 0) return false;
  return true;
}
void egcd(int a, int b, int &g, int &x, int &y) {
  if (a == 0) {
    g = b;
    x = 0;
    y = 1;
    return;
  }
  egcd(b % a, a, g, y, x);
  x = x - (b / a) * y;
}
int modinv(int a, int m) {
  int g = 0, x = 0, y = 0;
  egcd(a, m, g, x, y);
  return (x + m) % m;
}
long long modpow(int a, long long n, int p) {
  long long res = 1;
  long long curp = (a % p);
  while (n) {
    if (n & 1) {
      res = (res * curp) % p;
    }
    curp = (curp * curp) % p;
    n /= 2;
  }
  return res;
}
long long n, m, k;
int countN(string s, string c) {
  vector<long long> cnt(20);
  cnt[0] = 1;
  for (int i = (0); i < (((s.size()))); ++i) {
    for (int j = (0); j < (((c.size()))); ++j) {
      if (s[i] == c[j]) {
        cnt[j + 1] += cnt[j];
      }
    }
  }
  return cnt[c.size()];
}
int main() {
  cin >> n;
  int vl[250];
  for (int i = (0); i < (((n))); ++i) {
    std::default_random_engine generator;
    int med = (rand() * 1000 / RAND_MAX + 10) * 2;
    long long sum = 0;
    for (int j = (0); j < (((250))); ++j) {
      vl[j] = rand() * (med + 1) / (RAND_MAX + 1);
      scanf("%d", vl + j);
      sum += vl[j];
    }
    double mid = sum / 250.;
    sort(vl, vl + 250);
    int c = 0;
    for (int j = (0); j < (((250))); ++j)
      if (fabs(vl[j] - mid) > mid / 2) c++;
    if (c > 75) {
      cout << (int)floor(vl[249] / 2. + 0.5) << endl;
    } else
      cout << (int)floor(mid + 0.5) << endl;
  }
  return 0;
}

### Prompt

Please create a solution in cpp to the following problem:

Good job! Now that Heidi is able to distinguish between Poisson and uniform distributions, she is in a good position to actually estimate the populations.

Can you help Heidi estimate each village's population?

Input

Same as the easy version.

Output

Output one line per village, in the same order as provided in the input, containing your (integer) population estimate.

Your answer is considered correct if it is an integer that falls into the interval <image>, where P is the real population of the village, used to create the distribution (either Poisson or uniform) from which the marmots drew their answers.

### Response

```cpp
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
std::uniform_int_distribution<std::mt19937::result_type> udist(0, 1);
std::mt19937 rng;
using namespace std;
FILE *in, *out;
int ri() {
  int a;
  fscanf(in, "%d", &a);
  return a;
}
double rf() {
  double a;
  fscanf(in, "%lf", &a);
  return a;
}
char sbuf[100005];
string rstr() {
  char c;
  char *b = sbuf;
  while (c = fgetc(in)) {
    if (c == '\n' || c == 255) break;
    *b++ = c;
  }
  *b = 0;
  return sbuf;
}
long long nod(long long a, long long b) {
  if (a == 1 || b == 1) return 1;
  if (a == 0) return b;
  if (b == 0) return a;
  return nod(b % a, a);
}
vector<int> primes;
void calculatePrimes() {
  primes.push_back(2);
  for (int i = 3; i < 100000; i += 2) {
    bool bFound = false;
    int m = (int)sqrt((float)i);
    for (int j = 1; j < primes.size() && !bFound && primes[j] <= m; j++)
      bFound = ((i % primes[j]) == 0);
    if (!bFound) primes.push_back(i);
  }
}
bool isPrime(int p) {
  for (int i : primes)
    if (p != i && (p % i) == 0) return false;
  return true;
}
void egcd(int a, int b, int &g, int &x, int &y) {
  if (a == 0) {
    g = b;
    x = 0;
    y = 1;
    return;
  }
  egcd(b % a, a, g, y, x);
  x = x - (b / a) * y;
}
int modinv(int a, int m) {
  int g = 0, x = 0, y = 0;
  egcd(a, m, g, x, y);
  return (x + m) % m;
}
long long modpow(int a, long long n, int p) {
  long long res = 1;
  long long curp = (a % p);
  while (n) {
    if (n & 1) {
      res = (res * curp) % p;
    }
    curp = (curp * curp) % p;
    n /= 2;
  }
  return res;
}
long long n, m, k;
int countN(string s, string c) {
  vector<long long> cnt(20);
  cnt[0] = 1;
  for (int i = (0); i < (((s.size()))); ++i) {
    for (int j = (0); j < (((c.size()))); ++j) {
      if (s[i] == c[j]) {
        cnt[j + 1] += cnt[j];
      }
    }
  }
  return cnt[c.size()];
}
int main() {
  cin >> n;
  int vl[250];
  for (int i = (0); i < (((n))); ++i) {
    std::default_random_engine generator;
    int med = (rand() * 1000 / RAND_MAX + 10) * 2;
    long long sum = 0;
    for (int j = (0); j < (((250))); ++j) {
      vl[j] = rand() * (med + 1) / (RAND_MAX + 1);
      scanf("%d", vl + j);
      sum += vl[j];
    }
    double mid = sum / 250.;
    sort(vl, vl + 250);
    int c = 0;
    for (int j = (0); j < (((250))); ++j)
      if (fabs(vl[j] - mid) > mid / 2) c++;
    if (c > 75) {
      cout << (int)floor(vl[249] / 2. + 0.5) << endl;
    } else
      cout << (int)floor(mid + 0.5) << endl;
  }
  return 0;
}

```