二分贪心 U
来源:互联网 发布:ipad怎么发布淘宝宝贝 编辑:程序博客网 时间:2024/06/04 23:19
题目:
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 con- sideration, 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, first print the number of the set, as shown in the sample output. Then print the line "The minimum number of moves is k.", where k is the minimum number of bricks that have to be moved in order to make all the stacks the same height.
Output a blank line after each set.
Output a blank line after each set.
Sample Input
65 2 4 1 7 50
Sample Output
Set #1The minimum number of moves is 5.
分析:
求出平均值,只要比平均值大的加起来就是最少的移动数目;
代码:
#include<iostream>#include<vector>using namespace std;int main(){ int n,i,b,j=0; vector <int> a; while(cin>>n) { if(n==0) break; int p=0,h=0; j++; for(i=1;i<=n;i++) { cin>>b; a.push_back(b); p+=b; } p=p/n; for(i=0;i<n;i++) if(a[i]>p) h=h+(a[i]-p); cout<<"Set #"<<j<<endl; cout<<"The minimum number of moves is "<<h<<"."<<endl<<endl; for(i=1;i<=n;i++) a.pop_back(); } return 0;}
0 0
- 二分贪心 U
- 二分贪心 U
- 二分贪心 U题
- 二分贪心—U
- 二分贪心-U
- 二分贪心 U 堆墙
- ACM-二分贪心U-21
- 二分贪心——U
- 二分+贪心
- 贪心 + 二分
- 贪心二分
- 贪心+二分
- 贪心(bnuoj49103+二分+贪心)
- BNU 49103 贪心【二分+贪心】
- hdu pie(二分+贪心)
- POJ3497 Assemble 二分+贪心
- mysterious 二分加贪心
- HDU 3650 贪心+二分
- 编译windows程序遇到fatal error C1189 #error No Target Architecture
- XML解析之PULL
- 程序员英文学习日常记录
- zip压缩包解压乱码问题
- 全球著名编程大赛地址
- 二分贪心 U
- 笔记:关于adb push不生效
- DirectSound学习(三)--类、方法、属性翻译
- Android Studio插件大全之Sexy Editor【设置AS背景】——除了美便一无是处
- Hibernate之一级缓存
- 机器学习资料汇总(链接)
- 腾讯云服务器的配置与部署(一):云服务器的连接、项目(php与phpMyAdmin)的部署
- 引水工程 第八届河南省程序设计大赛
- java(Eclipse)快速封装方法