2402: Load Balancing
[Creator : ]
Description
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 $m_i$ 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 expressionma-mb, whereais the most loaded server andbis 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.
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^5)$ − the number of the servers.
The second line contains the sequence of non-negative integers $m_1,m_2,...,m_n\ (0≤m_i≤2·10^4)$, where $m_i$ is the number of tasks assigned to the $i$-th server.
The second line contains the sequence of non-negative integers $m_1,m_2,...,m_n\ (0≤m_i≤2·10^4)$, where $m_i$ is the number of tasks assigned to the $i$-th server.
Output
Print the minimum number of seconds required to balance the load.
Sample 1 Input
2
1 6
Sample 1 Output
2
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.
Sample 2 Input
7
10 11 10 11 10 11 11
Sample 2 Output
0
The load is already balanced.
Sample 3 Input
5
1 2 3 4 5
Sample 3 Output
3
A possible sequence of task movements for the example is:
- move a task from server #4 to server #1 (the sequence m becomes: 2 2 3 3 5);
- then move task from server #5 to server #1 (the sequence m becomes: 3 2 3 3 4);
- then move task from server #5 to server #2 (the sequence m becomes: 3 3 3 3 3).