H - Robin Hood

You are given an integer array $a$ of length $n$. You can perform the following operation any number of times: - Choose an element $x$ that is currently in the array. - Remove one copy of $x$ from the array. - For every remaining element $y$ in the array such that $y < x$, increase the value of $y$ by $1$. For example, if the array is initially $[1, 2, 4, 4, 5]$ and you choose $x = 4$, the array