HDOJ 2088 Box of Bricks(均值排序)
来源:互联网 发布:linux下安装samba 编辑:程序博客网 时间:2024/06/05 06:22
cfcfcf站位
Box of Bricks
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15307 Accepted Submission(s): 5087
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
Author
qianneng
Source
冬练三九之二
Recommend
lcy | We have carefully selected several similar problems for you: 2091 2069 2048 2064 2043
思路:
这输出方式也是学习了。
AC CODE:
#include<stdio.h>#include<cstring>#include<algorithm>#define HardBoy main()#define ForMyLove return 0;using namespace std;const int MYDD = 1103;int HardBoy {int n, h[MYDD], cnt = 0;while(scanf("%d", &n) && n) {if(cnt) puts("");//坑人的输出格式int ave = 0, ans = 0;for(int j = 0; j < n; j++) {scanf("%d", &h[j]);ave += h[j];}ave /= n;//平均值for(int j = 0; j < n; j++) {if(h[j] > ave) ans += (h[j]-ave);}printf("%d\n", ans);cnt++;}ForMyLove}
0 0
- HDOJ 2088 Box of Bricks(均值排序)
- HDOJ 2088 Box of Bricks
- HDOJ 2088 Box of Bricks
- HDOJ 2088 Box of Bricks
- HDOJ 【C】 2088 Box of Bricks
- HDOJ(HDU) 2088 Box of Bricks(平均值)
- hdoj 1326 Box of Bricks
- [hdoj试题]Box of Bricks
- Box of Bricks 2088
- 2088 Box of Bricks
- Box of Bricks 2088
- hdoj Box of Bricks 1326 (转换)水
- hdu 2088 Box of Bricks(water~)
- hdoj.1326 Box of Bricks 20140819
- HDOJ 1326 Box of Bricks(简单题)
- HDU 2088 Box of Bricks
- HDU 2088 Box of Bricks
- hdu 2088 Box of Bricks
- IE10-无法正常显示复选框,文本框里有乱码等显示异常
- 第五周项目七输入N显示不同N取值的情况
- Android学习之FragmentTabHost配合Fragment使用
- Android 实现百度地图API调用
- BaiDu地图API使用全解析--(1)---定位功能
- HDOJ 2088 Box of Bricks(均值排序)
- 贴片元件的焊接方法
- jquery的$.extend和$.fn.extend作用及区别
- springaop自动代理
- Component 'systray.ocx 'or one of its dependencies not correcyly registered;a file is missing or inv
- UiAutomator 正则表达式的使用
- Spark性能调优1
- Jsoup后台解析html、jsp网页
- 100天土鸡饲养计划(57)