m := map[string]int{
    "apple":  3,
    "banana": 1,
    "cherry": 5,
}

// 遍历并打印键值对
for key, value := range m {
    fmt.Printf("%s: %d\n", key, value)
}

import (
    "fmt"
    "sort"
)

keys := make([]string, 0, len(m))
for k := range m {
    keys = append(keys, k)
}

sort.Strings(keys) // 字符串键排序

for _, k := range keys {
    fmt.Printf("%s: %d\n", k, m[k])
}

type kv struct {
    Key   string
    Value int
}

pairs := make([]kv, 0, len(m))
for k, v := range m {
    pairs = append(pairs, kv{k, v})
}

// 按值降序排序
sort.Slice(pairs, func(i, j int) bool {
    return pairs[i].Value > pairs[j].Value
})

// 输出
for _, pair := range pairs {
    fmt.Printf("%s: %d\n", pair.Key, pair.Value)
}

sort.Slice(pairs, func(i, j int) bool {
    if pairs[i].Value == pairs[j].Value {
        return pairs[i].Key < pairs[j].Key // 键升序
    }
    return pairs[i].Value > pairs[j].Value // 值降序
})