input: Write a Python function that determines the minimum number of levels Alice should play in order to score more points than Bob, given that the levels can be cleared or not based on a binary array. If it’s not possible for Alice to score more, return -1. The function should ensure both players play at least one level each.
output: def minimum_levels_to_play(levels, alice_points, bob_points):
      total_points = sum(levels)
      if alice_points + 1 > total_points - bob_points - 1:
          return -1
      
      levels_sorted = sorted(levels, reverse=True)
      alice_cumulative = 0
      
      for i in range(len(levels_sorted)):
          alice_cumulative += levels_sorted[i]
          remaining_points = total_points - alice_cumulative
          if alice_cumulative > remaining_points - bob_points:
              return i + 1
      
      return -1