UVA591- Box of Bricks

題意：移動最少的磚，使所有堆的轉數量相同

思路：其實不管怎麼樣肯定是要把高出平均值的磚堆拿出給低於平均值的轉堆，所有只要記錄要移動高出平均值的磚堆的磚頭就可以了

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