Civen an array of $N$ integers, your task is to transform this array into a permutation of the first $M$ positive integers A pemutation of sire $N$ is an arrangoment of numbers such that each number from $1$ to $N$ appears exartly once In one operation, you can increase or decrease any element of the array by $1$

The challenge is to figure out the smallest number of such operations required to convert the given array into a permutation.

Examples $1$:

Input $N=[3,2,1,4]$

Output $0$

Explanation: No operation needed; already a permutation

Examples $2$:

Input $N=[4,1,4,2]$

Output: $1$

Explanation: Decrease one $\text{'}4\text{'}$ to $\text{'}3\text{'}$ to form the permutation $4,1,3,2$

Examples $3$:

Input $N=[2,3,4,5]$

Output: $4$

Explanation: $4$ operations to decrease each element by $1$ to reach permutation $1,2,3,4.$ Note that this is one of the possible permutations, e$.$g$.$ this can also be achieved by $4$ operations to decrease the $\text{'}5\text{'}$ to $\text{'}1\text{'}$ to form the permutation $,4,1.$

Constraints:

The integers in the array $N_{[]}$will be equal or bigger than $1.$

The size of the array $N$ can range from $1$ to ${10}^5.$

Something wrong with the question or blank content?