[백준]2108-통계학 (설명X)

#include <cstdio>
 
int main()
{
    int input;
    scanf("%d", &input);
    int* arr = new int[8001]{ 0, };
    for (size_t i = 0; i < input; i++)
    {
        int tmp;
        scanf("%d", &tmp);
        arr[tmp + 4000]++;
    }
    int sum = 0, index = 0, mid = 0, max = 0;
    for (size_t i = 0; i < 8001; i++)
    {
        sum += arr[i] * (i - 4000);
        if (index < (float) input / 2)
        {
            index += arr[i];
            if (index > input / 2)
                mid = i - 4000;
        }
        if (arr[i] > max)
            max = arr[i];
    }
    float sum_avg = (double)sum / input > 0 ? (double)sum / input + 0.5 : (double)sum / input - 0.5;
    printf("%d\n%d\n", (int)sum_avg, mid);
    int tmp1 = -4001, tmp2 = 0;
    for (int i = 8000; i >= 0; i--)
    {
        if (arr[i] == max) {
            tmp2 = tmp1;
            tmp1 = i - 4000;
        }
    }
    printf("%d\n", tmp1 < tmp2 ? tmp2 : tmp1);
    for (size_t i = 0; i < 8001; i++)
    {
        if (arr[i] > 0) {
            for (int j = 8000; j >= 0; j--)
            {
                if (arr[j] > 0) {
                    printf("%d\n", j - i);
                    delete[] arr;
                    return 0;
                }
            }
        }
    }
    return 0;
}