Thread: regarding queues

Hi, if I want to build a minimum priority queue and inserting by keys (not the letters) would it be w/ example of key-value pairs:
so inserting: (a->3), (b->10), (c->3), (d->1), (z->110)

(d->1), (a->3), (c->3), (b->10), (z->110)

OR IS IT:

(d->1), (c->3), (a->3), (b->10), (z->110)

so I'm confused when the new entry has the same key as a current entry, if it's the same, I think it makes more sense to put it after all entries that have same keys b/c it's a queue, but also minimum priority, so if it's not smaller, follow the rules of a queue, is that correct, so the the former final list is the proper miniimum priority queue? I just want to make sure.

Thanks for replying, I thought a min-PQ always meant priority, but what you say makes sense. I ask because I google online but the sources all show using all unique values, and no dupilcates, that's why I was a little confused. But in terms of building a Huffman tree, I need to arrange the characters from least to most frequency, so which way should I choose to be most efficient...or does it have same cost