package main

type pair struct {
	char uint8
	times int
}

type arrHeap struct {
	pariArr []*pair
}

func (a *arrHeap) Len() int {
	return len(a.pariArr)
}

func (a *arrHeap) Less(i, j int) bool {
	return
}

func (a *arrHeap) Swap(i, j int) {
	panic("implement me")
}

func (a *arrHeap) Push(x interface{}) {
	panic("implement me")
}

func (a *arrHeap) Pop() interface{} {
	panic("implement me")
}

func frequencySort(s string) {
	return ""
}


// Len is the number of elements in the collection.
func (cp *charHeap) Len() int {
	panic("not implemented") // TODO: Implement
}

// Less reports whether the element with
// index i should sort before the element with index j.
func (cp *charHeap) Less(i int, j int) bool {
	panic("not implemented") // TODO: Implement
}

// Swap swaps the elements with indexes i and j.
func (cp *charHeap) Swap(i int, j int) {
	panic("not implemented") // TODO: Implement
}

func (cp *charHeap) Push(x interface{}) {
	panic("not implemented") // TODO: Implement
}

func (cp *charHeap) Pop() interface{} {
	panic("not implemented") // TODO: Implement
}

type charHeap struct {

}