HDU 2088 Box of Bricks
来源:互联网 发布:黑客模拟软件 编辑:程序博客网 时间:2024/05/20 10:56
Box of Bricks
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15657 Accepted Submission(s): 5176
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.
Output a blank line between each set.
Sample Input
65 2 4 1 7 50
Sample Output
5
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ int h[55]; int ll=0; int n,sum,count; while(scanf("%d",&n),n) { sum=0; for(int i=0;i<n;i++) { scanf("%d",&h[i]); sum+=h[i]; } sum/=n; count=0; for(int i=0;i<n;i++) { if(h[i]>sum)//找到比平均值大的,记录差值 count+=h[i]-sum; } if(ll++) printf("\n"); printf("%d\n",count); } return 0;}
0 0
- HDU 2088 Box of Bricks
- HDU 2088 Box of Bricks
- hdu 2088 Box of Bricks
- HDU#2088: Box of Bricks
- HDU 2088 Box of Bricks
- HDU - 2088 - Box of Bricks
- HDU Box of Bricks
- hdu 2088 Box of Bricks(water~)
- HDU—— 2088 Box of Bricks
- HDOJ(HDU) 2088 Box of Bricks(平均值)
- HDU ACM 11 2088 Box of Bricks
- Box of Bricks 2088
- 2088 Box of Bricks
- Box of Bricks 2088
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- RadioGroup 和 ViewPager 联动
- 数据结构(三) 栈和队列
- 真正的inotify+rsync实时同步 彻底告别同步慢
- Android:Material Design之TextInputLayout使用
- java系统高并发解决方案(转载)
- HDU 2088 Box of Bricks
- CentOS7:ifconfig command not found解决
- NFS服务安装配置(centos7 nfs-utils示例)
- 安卓复习之旅—Thread、Runnable、Callable、Futrue类关系与区别
- connection problem
- Mybatis 时间段查询 和 模糊查询
- php变量与JS变量直接交互不通过跳转
- Service、Thread的区别和使用
- PDF文件怎么添加图片 如何编辑PDF图片