You are given a 0-indexed integer array scores, where each element represents the score of a player in a competition, and an integer targetScore. Your task is to determine the minimum number of operations required to ensure that all scores in the array are greater than or equal to targetScore.
If it is not possible to make all scores greater than or equal to target score return -1.
In one operation, you must:
Select the two lowest scores x and y from the array (only possible if the array has at least two elements).
Remove x and y from the array.
Add a new score equal to min(x, y) Ã 2 + max(x, y) to the array.