1477:Box of Bricks
来源:互联网 发布:xls文件解密软件 编辑:程序博客网 时间:2024/06/04 13:04
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.
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
65 2 4 1 7 50
Sample Output
Set #1The minimum number of moves is 5.
代码如下:
//acm 1477:Box of Bricks#include <iostream>using namespace std;int main(){int n,k = 1; //有 n 摞砖while (cin >> n && n){int *a = new int[n];int sum = 0,all_move_times = 0; //hi 表示每摞砖的高度for (int j = 0;j < n;j++){cin >> a[j];sum += a[j];}int avr_height = sum / n;for (int j = 0;j < n;j++){if(a[j] < avr_height)all_move_times += (avr_height - a[j]);}cout << "Set #" << k++ << endl;cout << "The minimum number of moves is " << all_move_times << "." << endl << endl;delete []a;}return 0;}
- 1477 Box of Bricks
- 1477:Box of Bricks
- 1477 Box of Bricks
- pku 1477 Box of Bricks
- PKU 1477 Box of Bricks
- poj 1477 Box of Bricks
- POJ 1477 Box of Bricks
- poj 1477 Box of Bricks
- POJ 1477:Box of Bricks
- POJ——1477 Box of Bricks
- POJ 1477 Box of Bricks G++
- Box of Bricks
- 591 - Box of Bricks
- HDOJ1326 Box of Bricks
- HDU1326:Box of Bricks
- 591 - Box of Bricks
- 591 - Box of Bricks
- UVA591- Box of Bricks
- 黑马程序员_基础回顾之集合
- CSU 1090: Number Transformation 一个非常好的优先队列打表
- C#简单的语法
- 【100题】含有指针成员的类的拷贝问题~~
- Windows 2003上安装 iTunes iTools
- 1477:Box of Bricks
- ExtJs3.4简介
- 三十分钟掌握STL
- 制作能够引导多个ISO的U盘
- 详述 SQL Server 补丁安装常见问题
- 提高QGraphicsItem移动效率的解决方案
- proteus仿真51单片机存在的若干问题
- 解耦的故事(转tmfc blog)
- 数据结构与算法之—数组(一)