Leetcode 1686. Stone Game VI

Two players alternately pick stones (Alice first) from n items where stone i gives aliceValues[i] to Alice and bobValues[i] to Bob; under optimal play, determine whether Alice wins (1), Bob wins (-1), or it's a draw (0). n can be up to 1e5, so an O(n log n) or better approach is required.