codefights matrixElementsSum easy

https://codefights.com/arcade/intro/level-2/xskq4ZxLyqQMCLshr/description

my answer is 

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

int matrixElementsSum(int[][] matrix) { int sum=0;       for(int i=0; i<matrix[0].length; i++){         sub:         for(int y=0; y<matrix.length;y++)    {             if(matrix[y][i] == 0){                     break sub;             }else{                 sum+= matrix[y][i];             }         }     }          return sum; }   Colored by Color Scripter

cs

After becoming famous, CodeBots decided to move to a new building and live together. The building is represented by a rectangular matrix of rooms, each cell containing an integer - the price of the room. Some rooms are free (their cost is 0), but that's probably because they are haunted, so all the bots are afraid of them. That is why any room that is free or is located anywhere below a free room in the same column is not considered suitable for the bots.

Help the bots calculate the total price of all the rooms that are suitable for them.

Example

For

matrix = [[0, 1, 1, 2], 
          [0, 5, 0, 0], 
          [2, 0, 3, 3]]

the output should be
matrixElementsSum(matrix) = 9.

Here's the rooms matrix with unsuitable rooms marked with 'x':

[[x, 1, 1, 2], 
 [x, 5, x, x], 
 [x, x, x, x]]

Thus, the answer is 1 + 5 + 1 + 2 = 9.