K-11
题目:
K - 11
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Submit
Status
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 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<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[100],sum=0,yd=0,s=0,q=0;
while(cin>>n&&n!=0)
{
sum=0;
q=0;
yd=0;
s++;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
int k=sum/n;
sort(a,a+n);
for(int x=0;x<n;x++)
{ if(a[x]<k)
q++;}
for(int b=0;b<q;b++)
yd+=k-a[b];
cout<<"Set #"<<s<<endl;
cout<<"The minimum number of moves is "<<yd<<"."<<endl<<endl;
}
return 0;
}
体会:
仔细审题,细节最重要,尤其是最后的’.’很容易漏掉,另外,注意每次循环都要初始化