using System;

using System.Collections.Generic;

using System.Linq;

​

public class Solution

{

    public static int[] KWeakestRows(int[][] mat, int k)

    {

        var listSumSoldiersInRow = new Dictionary<int, int>();

        for (var i = 0; i < mat.Length; i++)

        {

            var sumSoldiers = 0;

            for (var j = 0; j < mat[i].Length; j++)

            {

                sumSoldiers += mat[i][j];

            }

            listSumSoldiersInRow.Add(i, sumSoldiers);

        }

        // TODO: Tratar de usar SortedList, esto debe ser muy lento por culpa del Dictionary y LINQ

        var sortedListSumSoldiersInRow = listSumSoldiersInRow.OrderBy(v => v.Value);

        var indices = new int[k];

        for (var y = 0; y < k; y++)

        {

            indices[y] = sortedListSumSoldiersInRow.ElementAt(y).Key;

        }

        return indices;

    }

    public static void Main()

    {

        var test = new int [][] {

            new int[] {1,1,0,0,0},

            new int[] {1,1,1,1,0},

            new int[] {1,0,0,0,0},

            new int[] {1,1,0,0,0},

            new int[] {1,1,1,1,1}

        };

        var weakestRowsIndices = KWeakestRows(test, 5);

        foreach (var row in weakestRowsIndices)

        {

            Console.WriteLine(row);

        }

    }

}