Codeforces - 609C.Load Balancing 排序、模拟

1.题目描述：

C. Load Balancing

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there are mi tasks assigned to the i-th server.

In order to balance the load for each server, you want to reassign some tasks to make the difference between the most loaded server and the least loaded server as small as possible. In other words you want to minimize expression ma - mb, where a is the most loaded server and b is the least loaded one.

In one second you can reassign a single task. Thus in one second you can choose any pair of servers and move a single task from one server to another.

Write a program to find the minimum number of seconds needed to balance the load of servers.

Input

The first line contains positive number n (1 ≤ n ≤ 105) — the number of the servers.

The second line contains the sequence of non-negative integers m1, m2, ..., mn (0 ≤ mi ≤ 2·104), where mi is the number of tasks assigned to the i-th server.

Output

Print the minimum number of seconds required to balance the load.

Sample test(s)

input

2
1 6

output

2

input

7
10 11 10 11 10 11 11

output

0

input

5
1 2 3 4 5

output

3

Note

In the first example two seconds are needed. In each second, a single task from server #2 should be moved to server #1. After two seconds there should be 3 tasks on server #1 and 4 tasks on server #2.

In the second example the load is already balanced.

A possible sequence of task movements for the third example is:

1. move a task from server #4 to server #1 (the sequence m becomes: 2 2 3 3 5);
2. then move task from server #5 to server #1 (the sequence m becomes: 3 2 3 3 4);
3. then move task from server #5 to server #2 (the sequence m becomes: 3 3 3 3 3).

The above sequence is one of several possible ways to balance the load of servers in three seconds.

2.题目概述

给你n（1e5）个数a[]，我们可以把任一个数拿出1，给与另外任意一个数。 
这样我们到最后，有一个最大的数ma和一个最小的数mb，我们希望使得ma-mb尽可能小。 
并且，在实现这个目标的前提下，使得操作的步数尽可能少。 

3.解题思路

首先要让数列尽可能平均，那么肯定尽量是sum / n，那么接下来分别统计小于平均数的差值和大于平均数差值，输出最大的那个就是变动数了

4.AC代码

#include <cstdio>
#include <algorithm>
#define maxn 101000
using namespace std;
int a[maxn];
int main()
{
	int n, sum, Min, Max, ans1, ans2; 
	while (scanf("%d", &n) != EOF)
	{
		sum = ans1 = ans2 = 0;
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			sum += a[i];
		}
		Min = Max = sum / n;
		if (sum % n)
			Max++;
		for (int i = 0; i < n; i++)
			if (a[i] < Min)
				ans1 += Min - a[i];
			else if (a[i] > Max)
				ans2 += a[i] - Max;
		printf("%d\n", max(ans1, ans2));
	}
	return 0;
}