Boxes of Power Problem Statement

Given a set of boxes represented by an array gainPower, where each box has a certain power value, along with an initial power value 'power', your task is to maximize the total score by selecting boxes optimally. You can perform one of the following two operations:

Operations:

1. If gainPower[i] ≤ power, decrease your power by gainPower[i], increase your score by 1, and remove the box.
2. If your score is ≥ 1, increase your power by gainPower[i], decrease your score by 1, and remove the box.

Example:

Input:

T = 1
N = 3, power = 50
gainPower = [20, 30, 40]

Output:

2

Explanation:

You can pick boxes with power values 20 and 30 and perform the operations to get a maximum score of 2.

Constraints:

• 1 ≤ T ≤ 50
• 1 ≤ N ≤ 104
• 1 ≤ gainPower[i], power ≤ 104

Note:

Each box can be used at most once and there's no necessity to remove all the boxes.