|
Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Сложность Альфа
There are n
sticks with some lengths. Your task is to modify the sticks so that each stick has the same length.
You can either lengthen and shorten each stick. Both operations cost x
where x
is the difference between the new and original length.
What is the minimum total cost?
Input
The first input line contains an integer n
: the number of sticks.
Then there are n
integers: p1,p2,…,pn
: the lengths of the sticks.
Output
Print one integer: the minimum total cost.
Constraints
Example
Input:
5
2 3 1 5 2
Output:
5
Для отправки решений необходимо выполнить вход.
|