Delete Greatest Value in Each Row

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

Perform the following operation until grid becomes empty:

• Delete the element with the greatest value from each row. If multiple such elements exist, delete any of them.

• Add the maximum of deleted elements to the answer.

Note that the number of columns decreases by one after each operation.

Return the answer after performing the operations described above.

LeetCode Problem - 2500

class Solution {
    public int deleteGreatestValue(int[][] grid) {
        // Sort each row in the grid
        for (int[] row : grid) {
            Arrays.sort(row);
        }

        int col = grid[0].length; // Get the number of columns
        int row = grid.length;    // Get the number of rows
        List<Integer> al = new ArrayList<>(); // Initialize a list to store column elements
        int answer = 0; // Initialize the answer to 0

        // Iterate over columns from right to left
        for (int i = col - 1; i >= 0; i--) {
            al.clear(); // Clear the list for the new column
            // Add the elements of the current column to the list
            for (int j = 0; j < row; j++) {
                al.add(grid[j][i]);
            }
            // Sort the list to find the greatest value in the column
            Collections.sort(al);
            // Add the greatest value in the column to the answer
            answer += al.get(al.size() - 1);
        }
        return answer; // Return the final answer
    }
}