Kerill3

#include "pch.h"
#include <iostream>

int sra(int a)
{
    int count = 0, sum = 0;
    while (a > 0)
    {
        sum += (a % 10);
        a /= 10;
        count++;
    }
    return (float)sum / count;
}

void ShellSort(int *x, int n)
{
    int i, j, step;
    int tmp;

    for (step = n / 2; step > 0; step /= 2)
        for (i = step; i < n; i++)
        {
            tmp = x[i];
            for (j = i; j >= step; j -= step)
            {
                if (sra(tmp) < sra(x[j - step]))
                    x[j] = x[j - step];
                else
                    break;
            }
            x[j] = tmp;
        }
    }

int main()
{
    int i, n, sum=0, count=0;
    int *x;

    scanf_s("%d", &n);
    x = (int *)malloc(n * sizeof(int));
    for (i = 0; i < n; i++)
        scanf_s("%d", &x[i]);

    ShellSort(x, n);

    for (i = 0; i < n; i++)
        printf("%d ", x[i]);
    return 0;

}