Box of Bricks

题意翻译

有一些砖块堆砌成的列，给定每列砖中砖块的个数。由于砖块个数不同，导致某些列砖的高矮不同。问最少移动多少块砖，才能使得每一列砖的高矮都完全一样？

题目描述

[problemUrl]: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=7&page=show_problem&problem=532 [PDF](https://uva.onlinejudge.org/external/5/p591.pdf) ![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA591/f7b8dd90dc038ee9624031cf8f77315874bc7b4b.png)

输入输出格式

输入格式

![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA591/6a9c43e4255f3b947a68c5cff360e787852c681e.png)

输出格式

![](https://cdn.luogu.com.cn/upload/vjudge_pic/UVA591/fc218620cbf5c70559482435addebb18567421a0.png)

输入输出样例

输入样例 #1

6
5 2 4 1 7 5
0

输出样例 #1

Set #1
The minimum number of moves is 5.