C# 代码
public class Solution {
public int DeleteGreatestValue(int[][] grid) {
int n = grid.Length, m = grid[0].Length;
for (int i = 0; i < n; i++){
Array.Sort(grid[i]);
}
int result = 0;
for (int j = 0; j < m; j++){
int max = 0;
for (int i = 0; i < n; i++){
max = Math.Max(max, grid[i][j]);
}
result += max;
}
return result;
}
}