package main

import (
	"fmt"
	"sort"
)

func kWeakestRows(mat [][]int, k int) (res []int) {
	n, m := len(mat), len(mat[0])
	matInfo := make([][2]int, n, n)
	for i := 0; i < n; i++ {
		soNumber := 0
		for j := 0; j < m; j++ {
			if mat[i][j] == 1 {
				soNumber++
			}
		}
		matInfo[i][0], matInfo[i][1] = soNumber, i
	}

	sort.Slice(matInfo, func(i, j int) bool {
		if matInfo[i][0] == matInfo[j][0] {
			return matInfo[i][1] < matInfo[j][1]
		}
		return matInfo[i][0] < matInfo[j][0]
	})
	subMat := matInfo[:k]
	for _, v := range subMat {
		res = append(res, v[1])
	}
	return res
}

func main() {
	fmt.Println(kWeakestRows([][]int{{1, 1, 0}, {1, 1, 0}, {1, 1, 1}, {1, 1, 1}, {0, 0, 0}, {1, 1, 1}, {1, 0, 0}}, 6))
}

/*
{1,1,0},
{1,1,0},
{1,1,1},
{1,1,1},
{0,0,0},
{1,1,1},
{1,0,0},


*/