package main

import (
	"container/heap"
	"sort"
)

type heapArr struct{ sort.IntSlice }

func (h *heapArr) Less(i, j int) bool {
	return *&h.IntSlice[i] > *&h.IntSlice[j]
}

func (h *heapArr) Push(x interface{}) {
	*&h.IntSlice = append(*&h.IntSlice, x.(int))
}

func (h *heapArr) Pop() interface{} {
	old, n := *&h.IntSlice, len(*&h.IntSlice)
	x := old[n-1]
	old = old[:n-1]
	*&h.IntSlice = old
	return x
}

func minStoneSum(piles []int, k int) int {
	h := heapArr{}
	heap.Init(&h)
	res := 0
	sum := 0
	for _, v := range piles {
		sum += v
		heap.Push(&h, v)
	}
	for i := 0; i < k; i++ {
		top := heap.Pop(&h).(int)
		v := top / 2
		res += v
		top -= v
		heap.Push(&h, top)
	}
	return sum - res
}

func main() {

}