UVA 591-Box of Bricks

UVA 591-Box of Bricks

题目大意：给不同高的积木，移动最少次，使积木一样高

解题思路：向平均数看齐

#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
    int n;
    int x = 0;
    while(1) {
        x++;
        cin >> n;
        if(n == 0)
            break;
        int a[100];
        int s = 0;
        for(int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
            s = s + a[i];
        }
        s = s / n;
        int m = 0;
        for(int i = 0; i < n; i++) {
            if(a[i] > s)
                m = m + a[i] - s;
        }
        printf("Set #%d\n", x);
        printf("The minimum number of moves is %d.\n", m);
        printf("\n");
    }

    return 0;
}