H - P to Q

You are given $2$ permutations $P$ and $Q$ of the integers $1$ to $N$. Your score $S$ is initialized as $\text{inversions}(P)^{\dagger}$. You can do the following operation at most $10 \cdot N$ times: - Select any integer $x$ satisfying $1 \le x \le N$. Delete $x$ from $P$, and then insert $x$ back into $P$ in any desired location. Replace $S$ with $\max(S, \text{inversions}(P))$. Your goa