时间限制:1 Sec
内存限制:128 MiB

提交:91
答案正确:37

So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since ZY is lazy he wants to do this with the minimum number of bricks moved. Can you help?

Little ZY likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I've built a wall!”, he tells his small friend WX. “Nah, you should make all stacks the same height. Then you would have a real wall.”, he retorts. After a little consideration, ZY sees that she is right.

The input consists of several data sets. Each set begins with a line containing the number n of stacks ZY has built. The next line contains n numbers, the heights hi of the n stacks. You may assume 1≤n≤50 and 1≤hi≤100.

The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to rearrange the bricks such that all stacks have the same height.

The input is terminated by a set starting with n = 0. This set should not be processed.

For each set, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.

Output a blank line between each set

复制

6 5 2 4 1 7 5 0

复制

5