Alice and Bob take turns playing a game with $n$ stones, where Alice plays first.

You are given two integer arrays, aliceValues and bobValues, both of length $n$. If Alice chooses the stone at index i, she receives aliceValues[i] points. If Bob chooses the stone at index i, he receives bobValues[i] points.

On each turn, a player removes one unchosen stone from the game and adds its corresponding point value to their total score. The game ends when all stones have been removed. Both players play optimally to maximize their respective total scores.

Return $1$ if Alice wins, $-1$ if Bob wins, and $0$ if the game ends in a draw.

Constraints:

• n == aliceValues.length == bobValues.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ aliceValues[i], bobValues[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.