MEXimize the Array

You are given an array $A$ of length $N$. You can do the following operation any number of times: - Select any index $i$ $(1 \le i \le N)$ and either increase $A_i$ by $1$ or decrease $A_i$ by $1$. Find the **minimum** number of operations required to make the MEX of the array maximum possible. The MEX (minimum excluded) of an array is the smallest non-negative integer that does not belong to t