You are given an m $ imes$ n matrix grid consisting of positive integers.

Perform the following process repeatedly until grid becomes empty:

1. Delete the maximum value from each row. If a row contains multiple copies of the maximum value, delete any one of them.

2. Identify the greatest value among all the elements removed across every row in the current step.

3. Add this value to a running total.

Return the final sum obtained after all elements are removed from grid.

Constraints:

• m $==$ grid.length

• n $==$ grid[i].length

• $1 \leq$ m, n $\leq 50$

• $1 \leq$ grid[i][j] $\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.