<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/the-k-weakest-rows-in..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/1337/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let kWeakestRows (mat: int list list) (k: int) : int list =
    mat
    |&gt; List.mapi (fun i v -&gt;
        let count = v |&gt; List.reduce (+)
        i, count)
    |&gt; List.sortWith (fun (i, a) (j, b) -&gt;
        if a &lt;&gt; b then
            compare a b
        else
            compare i j)
    |&gt; List.take k
    |&gt; List.map fst
</code></pre>


## URL

https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/

## Code

https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/1337/main.fsx

```fsharp
let kWeakestRows (mat: int list list) (k: int) : int list =
    mat
    |> List.mapi (fun i v ->
        let count = v |> List.reduce (+)
        i, count)
    |> List.sortWith (fun (i, a) (j, b) ->
        if a <> b then
            compare a b
        else
            compare i j)
    |> List.take k
    |> List.map fst
```

LeetCode 1337. The K Weakest Rows in a Matrix in F#

URL

Code