Simply Equal :
Difficulty Level : Easy
Submissions : 59
Asked In :
Marks :10
: 0 | : 0
Amy has an array $$$a$$$ of $$$N$$$ integers. In one operation, she can select a non-empty subsequence of A, and decrease each element of the subsequence by 1.
Find the minimum number of operations required to make all the elements of the array equal.
Input
The first line of input consists of a single integer $$$N$$$ $$$(1 \leq N \leq 10^6)$$$ $$$-$$$ the total number of elements in the array. The second line of the input consists of $$$N$$$ space separated integers - the elements of the array $$$(1 \leq a[i] \leq 10^9)$$$.
Output
The output should consist of a single integer - the minimum number of operations required to make all the elements of the array equal.
Example
Input
3 2 1 2
Output
1
