Minimum Squared Sum

You are given an array of $N$ integers. Let $a_i$ be the $i^{th}$ integer in the array. Find two integers $X$ and $Y$ such that the sum : $$\sum_{i=1}^n \min((X-a_i)^2, (Y-a_i)^2)$$ is minimised. Report the minimum sum. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of two lines of input. - The first line o