HDU 1.2.2 Box of Bricks
来源:互联网 发布:北京口语培训班 知乎 编辑:程序博客网 时间:2024/06/06 12:36
Box of Bricks
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7422 Accepted Submission(s): 1717Problem 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 <stdio.h>#include <algorithm>using namespace std;int main(){ int n,cas = 1; while(~scanf("%d",&n),n) { int a[100],i,sub = 0; for(i = 0;i<n;i++) { scanf("%d",&a[i]); sub+=a[i]; } sub = sub/n; sort(a,a+n); int sum = 0; printf("Set #%d\nThe minimum number of moves is ",cas++); while(a[n-1]>sub) { if(a[n-1]-sub>sub - a[0])//最大的达到平均值时多出的比最小的欠缺的多,把小的补满,大的统计剩余的 { sum+=sub-a[0]; a[n-1] = a[n-1] - (sub-a[0]); } else if(a[n-1]-sub == sub - a[0])//相等则两两补满 { sum+=a[n-1]-sub; a[n-1] = sub; a[0] = sub; } else//小于,则先把最大的变成平均,多出的移到最少 { sum += a[n-1] - sub; a[n-1] = sub; a[0] = a[0] + a[n-1] - sub; } sort(a,a+n);//每次都排序一次 } printf("%d.\n\n",sum); } return 0;}
0 0
- HDU 1.2.2 Box of Bricks
- HDU 1.2.2 Box of Bricks
- HDU Box of Bricks
- (1.2.2) Box of Bricks
- 1.2.2 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 2088 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 2088 Box of Bricks
- HDU 1326 Box of Bricks
- hdu 2088 Box of Bricks
- HDU 1326 Box of Bricks
- HDU#2088: Box of Bricks
- HDU 2088 Box of Bricks
- HDU - 2088 - Box of Bricks
- hdu 1326 Box of Bricks
- 1.2.4 Box of Bricks
- hdu 2088 Box of Bricks(water~)
- java面试题及答案(基础题122道,代码题19道)
- eclipse注释模板导入例子
- MFC对话框最大化、最小化、全屏显示、可拉伸、(控件大小动态化)、滚动条
- 第十一周项目1(2)调用函数输出星号图
- 专业函数绘图软件Origin
- HDU 1.2.2 Box of Bricks
- android Bitmap使用技巧
- IOS Runtime
- 运用JS设置cookie、读取cookie、删除cookie
- 在OJ上的代码也能看,不用怕上传之后忘了保存的代码丢掉了
- List和Iterator在用hibernate查询时候的区别
- CareerCup 17 中等难题 Q17.4 不用比较找出两数较大值
- kinetis 学习之(一) GPIO
- IOS - UIImage