HOJ 1599 Box of Bricks

http://acm.hit.edu.cn/hoj/problem/view?id=1599

计算移动砖块的次数

高度大于平均数的减去平均数求和即可

注意格式

#include <stdio.h>

int main()
{
    int n, h[128], i, j, sum, avg, count, k;
    
    count = 0;
    while (scanf("%d", &n) && n)
    {
        sum = 0;
        k = 0;
        count++;
        for (i = 0; i < n; i++)
        {
            scanf("%d", &h[i]);
            sum += h[i];
        }
        avg = sum / n;
        for (j = 0; j < n; j++)
        {
            if(h[j] > avg)
                k += h[j] - avg;
        }
        printf("Set #%d\n", count);
        printf("The minimum number of moves is %d.\n\n", k);
    }
    
    return 0;
}