Box of Bricks

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16906    Accepted Submission(s): 5577

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.

 

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

65 2 4 1 7 50

 

Sample Output

5

 

Author

qianneng

 

Source

冬练三九之二

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2087 2091 1022 2048 2073 

#include<iostream>#include<cstdlib>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<cstdlib>#include <set>#include<algorithm>#include <limits.h>#include <ctype.h>#include <map>#include <stack>#include <sstream>typedef long long LL;using namespace std;const int N = 105;int data[N][N];int dp[N][N];char c[100][100] = {' '};#define PI 3.1415926int main() {    //freopen("in.txt","r",stdin);    //freopen("out.txt","w",stdout);    int n;    int flag = 0;    while(scanf("%d", &n) != EOF){        if(n == 0) break;        if(flag) cout << endl;        int sum = 0;        vector<int> v1;        for(int i = 0; i < n; i++){            int temp;            cin >> temp;            v1.push_back(temp);            sum += temp;        }        int ave = sum / v1.size();        int ans = 0;        for(int i = 0; i < v1.size(); i++){            ans += v1[i] > ave ? v1[i] - ave : 0;        }        cout << ans << endl;        flag = 1;    }    return 0;}