Codeforce----Load Balancing

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 arem_i tasks assigned to thei-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 expressionm_a - m_b, wherea 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 ≤ 10⁵) — the number of the servers.

The second line contains the sequence of non-negative integers m₁, m₂, ..., m_n (0 ≤ m_i ≤ 2·10⁴), where m_i is the number of tasks assigned to thei-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.

题意：

给n个数，用最少的次数将这n个数拉"平均"，每次只能加减1.

例如:1,6。拉到“平均“水平是：3,4。最少移动次数是2.

1,2,3,4,6。拉到“平均”水平是：3,3,3,3,4。最少移动次数是3.

思路：

设所有数字和是sum，则“平均数”是ave=sum/n，也就是最终这一系列数字只能是ave或ave+1【如果sum%n ！=0】，只需要考虑移动大于ave或者ave+1【如果sum%n ！=0】的次数。

错误的处理方式：

int ans= 0;
int ave = sum / n;
if (sum%n) ave++;
for (int i = 0;i < n;i++)
{
	if (a[i] > ave)
		ans += a[i] - ave;
}

这样做虽然使得>ave的数字减小了，但是不能保证所有的小数字都增大了。也就是当 sum%n ！=0，ave+1的数字个数太多，导致部分小数字<ave。

例如：1,1,5,5,5。理想的最终状态是：3,3,3,4,4。而按照上述方式处理实际上得到的是：2,3,4,4,4。

这就需要考虑到ave+1的数字个数只能是count=sum%n个。

对于a[i]>sum/n中，应该有count个是ans+=a[i]-(ave+1)；剩下的是ans+=a[i]-ave.

如果满足a[i]>sum/n的个数小于count个也没关系，因为从a[i]减去的数会使小数字加到ave+1，从而使最终ave+1的数字个数满足count个。

#include <stdio.h>
#include <string.h>
#define maxn 100100
int a[maxn];
int main()
{
#ifdef LOCAL
	freopen("in3.txt", "r", stdin);
	freopen("out3.txt", "w", stdout);
#endif
	int n, ave, ans, count, sum;
	while (~scanf("%d", &n))
	{
		sum = 0;
		for (int i = 0;i < n;i++)
		{
			scanf("%d", &a[i]);
			sum += a[i];
		}
		ave = sum / n;
		count = sum%n;
		ans = 0;
		for (int i = 0;i < n;i++)
		{
			if (a[i]>ave)
			{
				if (count)
				{
					ans += (a[i] - (ave + 1));
					count--;
				}
				else ans += a[i] - ave;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}