<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/remove-stones-to-minimize-the-total/description/">Remove Stones to Minimize the Total - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1962/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1962/main.fsx</a></p>
<pre><code class="lang-plaintext">#r "nuget:FSharpx.Collections"

open FSharpx.Collections

let minStoneSum (piles: int list) (k: int) : int =
    let rec sumQueue (q: IPriorityQueue&lt;int&gt;) acc : int =
        match (PriorityQueue.tryPop q) with
        | None -&gt; acc
        | Some(v, q') -&gt; sumQueue q' (v + acc)

    let rec minStoneSum' (q: IPriorityQueue&lt;int&gt;) (k: int) =
        if k = 0 then
            sumQueue q 0
        else
            let v, q' = PriorityQueue.pop q
            let q'' = PriorityQueue.insert (v - (v / 2)) q'
            minStoneSum' q'' (k - 1)

    let q =
        piles
        |&gt; List.fold (fun acc n -&gt; PriorityQueue.insert n acc) (PriorityQueue.empty true)

    minStoneSum' q k
</code></pre>


## URL

[Remove Stones to Minimize the Total - LeetCode](https://leetcode.com/problems/remove-stones-to-minimize-the-total/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1962/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1962/main.fsx)

```plaintext
#r "nuget:FSharpx.Collections"

open FSharpx.Collections

let minStoneSum (piles: int list) (k: int) : int =
    let rec sumQueue (q: IPriorityQueue<int>) acc : int =
        match (PriorityQueue.tryPop q) with
        | None -> acc
        | Some(v, q') -> sumQueue q' (v + acc)

    let rec minStoneSum' (q: IPriorityQueue<int>) (k: int) =
        if k = 0 then
            sumQueue q 0
        else
            let v, q' = PriorityQueue.pop q
            let q'' = PriorityQueue.insert (v - (v / 2)) q'
            minStoneSum' q'' (k - 1)

    let q =
        piles
        |> List.fold (fun acc n -> PriorityQueue.insert n acc) (PriorityQueue.empty true)

    minStoneSum' q k
```

LeetCode 1962. Remove Stones to Minimize the Total in F#

URL

Code