Box of Bricks
来源:互联网 发布:哈尔滨淘宝培训 编辑:程序博客网 时间:2024/05/29 14:20
Box of Bricks
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10602 Accepted Submission(s): 2520Problem 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.
#include<iostream>#include<fstream>using namespace std;int Num[50];int main(){// freopen("test.txt","r",stdin); int n; int mark=0; while(cin>>n&&n) { mark++; int sum=0; for(int i=0;i<n;i++) { cin>>Num[i]; sum+=Num[i]; } int ave=sum/n; int num=0; for(int i=0;i<n;i++) { if(Num[i]>ave)num+=(Num[i]-ave); } cout<<"Set #"<<mark<<endl<<"The minimum number of moves is "<<num<<"."<<endl<<endl; } return 0;}
0 0
- Box of Bricks
- 1477 Box of Bricks
- 1477:Box of Bricks
- 1477 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
- BNU Box of Bricks
- Box of Bricks
- hdu1326 Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- 开门人和关门人
- 排名
- Rank
- Docker#docker dead but pid file exists
- decimal system
- Box of Bricks
- 各大公司Java后端开发面试题总结
- ubantu安装mysql
- oracle 恢复delete数据
- 最小公倍数
- 语法分析
- 系统和用户的环境变量配置文件
- C#控制IE浏览器
- [IDEA]快捷键使用心得1