水题 Box of Bricks

原创 2016年05月24日 00:01:53

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;
}





HDU1326_Box of Bricks【水题】

题目大意:给你N堆砖块的高度,为了使N堆砖块的高度已知,需要把高的堆上的 砖块移到低的堆上,问最少需要移多少块砖。 思路:计算出总共的砖块数,在求出N堆砖的平均高度(即需要达到的最终高度),把 高的堆...
  • u011676797
  • u011676797
  • 2014年11月21日 19:51
  • 1080

HDU2088 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • i1020
  • i1020
  • 2016年11月25日 22:07
  • 109

uva 591 Box of Bricks(求平均值)

Box of Bricks  Little Bob likes playing with his box of bricks. He puts the bricks one upon a...
  • u011328934
  • u011328934
  • 2013年07月31日 10:25
  • 1581

HDU2088 Box of Bricks【水题】

题目大意:给你N堆砖的高度,通过移动,使得这N堆砖变得一样高,问最少移动 多少块砖。 思路:先求出变得一样高的高度(平均高度),再遍历一遍高度,低于平均高度的砖 与平均高度相差的高度差的总和就是所求结...
  • u011676797
  • u011676797
  • 2015年01月15日 22:06
  • 740

HDU 1326 Box of Bricks(数学题)

HDU 1326 Box of Bricks(数学题)
  • u012860063
  • u012860063
  • 2014年09月06日 09:44
  • 985

HDU1326:Box of Bricks

Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon an...
  • libin56842
  • libin56842
  • 2013年04月16日 15:14
  • 3289

【贪心】 Box of Bricks

Description Little Bob likes playing with his box of bricks. He puts the bricks one upon anothe...
  • u012970471
  • u012970471
  • 2014年07月24日 12:32
  • 535

杭电 acm Box of Bricks

#include #include using namespace std; int main() { int n,a[100],sum=0,ave,kase=0,coun=0; wh...
  • lgybetter
  • lgybetter
  • 2015年03月31日 00:22
  • 141

UVA - 591 Box of Bricks (水题)

给你n堆高度不一的砖块,问你把这n堆砖块变成相同高度,需要最少移动的砖块数。 开始题目没仔细看,以为照样是求变成相同高度的最小移动次数,这题只要求出平均值,然后累加有多少大于这个均值的即可,因为大于...
  • u012773338
  • u012773338
  • 2014年12月24日 20:58
  • 245

水题 ~ HDU 1326 Box of Bricks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submissio...
  • RocketBoyc
  • RocketBoyc
  • 2016年11月14日 18:47
  • 124
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:水题 Box of Bricks
举报原因:
原因补充:

(最多只允许输入30个字)