UVA 591 Box of Bricks

题目

一盒砖

分析

搬运的次数即是到平均线的距离和。

代码

#include <stdio.h>int main(void){    int h[55], t = 1, n, i, sum, min;    while (scanf("%d", &n), n) {        for (sum = i = 0; i < n; i++) {            scanf("%d", &h[i]);            sum += h[i];        }        sum /= n;        for (min = i = 0; i < n; i++)            if (h[i] > sum)                min += (h[i] - sum);        printf("Set #%d\nThe minimum number of moves is %d.\n\n", t++, min);    }    return 0;}