You can do such a perfect representation of priority queues using (binary) heaps data structure, using it you can implement stacks and queues...
In priority queues it's a matter of preference, not FILO principle like in stacks.
You can find all of this in Cormen et al., Introduction to Algorithms, 3rd edition.
okay, implementation of priority queues using heaps is related to the property of the heap, max_heap or min_heap so Min_priority_queue can be implemented using min_heap by using the procedures used for heaps like BUILD_HEAP() first, MAX_HEAPIFY(), INCREASE_KEY(), INSERTION and DELETION.
note that (binary)heap itself is an array object can be shown as a nearly complete binary search tree...
for stack implementation (there is psudo code)
Inner class Element
int priority // priority of the element.
Key element // the element it self
next_priority = 0;
void push(Key x) // value of the pushed element
// as popping some element the next push must take its place
To implement queue using priority queue(HEAP) the same but the priority decreases one after another.