水题 Box of Bricks

Box of Bricks

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9748 Accepted Submission(s): 2304
 
Problem Description
Little Bob 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 older sister Alice. “Nah, you should make all stacks the same height. Then you would have a real wall.”, she retorts. After a little consideration, Bob sees that she is right. So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimum number of bricks moved. Can you help?
 
Input
The input consists of several data sets. Each set begins with a line containing the number n of stacks Bob 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.
 
Output

            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.
 
Sample Input
6
5 2 4 1 7 5
0
 
Sample Output
Set #1
The minimum number of moves is 5.

AC Code



#include<iostream>
using namespace std;


int main()
{
int i = 1;
int n;


int a[50];


while (cin >> n&&n)
{
int move = 0;
int sum = 0;


for (int j = 0; j<n; j++)
{
cin >> a[j];
sum += a[j];
}


int aver = sum / n;


for (int j = 0; j<n; j++)
if (a[j]<aver)
move += aver - a[j];


cout << "Set #" << i << endl;
cout << "The minimum number of moves is " << move << "." << endl << endl;


i++;
}


return 0;
}





阅读更多
文章标签: ACM水题HDOJ
个人分类: ACM水题HDOJ
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

水题 Box of Bricks

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭