Skill Game

**This problem has subtasks**. There are $N$ players numbered $1$ to $N$ where the $i^{th}$ player has a skill level of $S_i$. All skill levels are **distinct** initially and in range $[1, N]$. A total of $\frac{N \cdot (N - 1)}{2}$ matches are scheduled between all possible pairs of players. In a match between players with different skills, the player with higher skill wins. Let $W_i$ denot