二分贪心 U

60 阅读 0 评论 40 点赞

我是靠谱客的博主务实马里奥，最近开发中收集的这篇文章主要介绍二分贪心 U，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

题目：

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.

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.

Sample Input

6
5 2 4 1 7 5
0

Sample Output

Set #1
The 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;
}