HDU#2088: Box of Bricks
来源:互联网 发布:网易新闻app源码 编辑:程序博客网 时间:2024/05/09 12:00
Time Limit: 1000MS
Memory Limit: 32768KB
64bit IO Format: %I64d & %I64u
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
5
Source
冬练三九之二
AC代码如下:
#include<iostream>using namespace std;int main(){ int n,flag=0,k=-1; while(cin>>n&&n!=0) { if(k!=-1) cout<<endl; int sum=0,h=0,min=0,a[10000]; for(int i=0;i<n;i++) { cin>>a[i]; sum+=a[i]; } h=sum/n; for(int i=0;i<n;i++) { if(a[i]<h) { min+=(h-a[i]); } else continue; } cout<<min<<endl; ++k; } return 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
- Matlab中用一个For循环连续读入并显示几个图像文件 [转]
- Comand+/不能使用
- 深度学习(二十九)Batch Normalization 学习笔记
- Filter及FilterChain的使用详解
- 大纲
- HDU#2088: Box of Bricks
- 庆祝blog创建成功
- 分布式服务框架之服务化最佳实践
- DFS序
- Linux1_gcc与g++
- 在职研究生有用吗?
- RN和IOS相互引用
- 深度学习(三十)贪婪深度字典学习
- hive 优化 tips