# [Leet Code] The K Weakest Rows in a Matrix

• The number of soldiers in row `i` is less than the number of soldiers in row `j`.
• Both rows have the same number of soldiers and `i < j`.
`Input: mat = [[1,1,0,0,0], [1,1,1,1,0], [1,0,0,0,0], [1,1,0,0,0], [1,1,1,1,1]], k = 3Output: [2,0,3]Explanation: The number of soldiers in each row is: - Row 0: 2 - Row 1: 4 - Row 2: 1 - Row 3: 2 - Row 4: 5 The rows ordered from weakest to strongest are [2,0,3,1,4].`
`Input: mat = [[1,0,0,0], [1,1,1,1], [1,0,0,0], [1,0,0,0]], k = 2Output: [0,2]Explanation: The number of soldiers in each row is: - Row 0: 1 - Row 1: 4 - Row 2: 1 - Row 3: 1 The rows ordered from weakest to strongest are [0,2,3,1].`
• `m == mat.length`
• `n == mat[i].length`
• `2 <= n, m <= 100`
• `1 <= k <= m`
• `matrix[i][j]` is either 0 or 1.
`class Solution(object):    def kWeakestRows(self, mat, k):        """        :type mat: List[List[int]]        :type k: int        :rtype: List[int]        """        answers = {}        for i,v in enumerate(mat):            answers[i] = v.count(1)                print answers        answers_answers = []        for i in sorted(answers.items(), key=lambda answers: answers):            print i            if len(answers_answers) == k:                return answers_answers            else:                answers_answers.append(i)                        return answers_answers`

--

--