You are given an array A of N

$($

$>$

$=$

$3$

$)$

$$distinct integers. Your friend Allen removes only

$2$

$$elements from this array, adds a value

$($

$>$

$0$

$)$

$$to all the remaining elements shuffles the array and leaves the newly formed array G for you. Your task is to return the minimum possible value that Allen had added to each element of array A to get to array G

$.$

$$It is guaranteed that atleast one such value which will be greater than

$0$

$$will always exist. Java code