package main

import (
	"container/heap"
	"sort"
)

type HeapArr struct {
	sort.IntSlice
}

func (h *HeapArr) Pop() interface{} {
	n := len(h.IntSlice)
	t := (h.IntSlice)[n -1]
	h.IntSlice = (h.IntSlice)[:n-1]
	return t
}

func (h *HeapArr) Push(node interface{})  {
	h.IntSlice = append(h.IntSlice, node.(int))
}



// 小顶堆
func topKFrequent(words []string, k int) []string {
	freqMap := make(map[string]int)
	for _ , v := range words {
		freqMap[v] ++
	}
	h := HeapArr{
		make([]int,0 ,0),
	}
	heap.Init(&h)


}

func main() {

}