1
class Solution {
2
 public:
3
  double solve(vector<int> &arr, int n) {
4
    double count = 0;
5
    for (int i = 0; i < arr.size(); i++) {
6
      count += arr[i];
7
      if (count >= n) return i;
8
    }
9
    return -1;
10
  }
11
  vector<double> sampleStats(vector<int> &count) {
12
    int mini = INT_MAX;
13
    int maxi = 0;
14
    double sum = 0.0;
15
    int d = 0;
16
    int mode = 0;
17
    for (int i = 0; i < count.size(); i++) {
18
      if (count[i] == 0) continue;
19
      mini = min(mini, i);
20
      maxi = max(maxi, i);
21
      sum += double(count[i]) * i;
22
      d += count[i];
23
      if (count[mode] < count[i]) mode = i;
24
    }
25
    vector<double> ans(5, 0.0);
26
    ans[0] = mini;
27
    ans[1] = maxi;
28
    ans[2] = sum / d;
29
    ans[4] = mode;
30
    if (d % 2 == 0) {
31
      ans[3] = (solve(count, d / 2) + solve(count, d / 2 + 1)) / 2;
32
    } else
33
      ans[3] = solve(count, d / 2 + 1);
34
    return ans;
35
  }
36
};