Implement Priority Queue with a Heap

I need some help with my homework. My teacher just went over the "theory" of how to do this not how to go about writing the actual code. Can someone do this example problem in the book for me so I can understand it how to do the coding for future references?

Implement a priority queue with a heap. The program would supply a menu to allow the user to choose either to input a new entry to request computer CPU time or allow the computer system to output the next name to use the system. For the input mode the user would enter their name and a computer access priority (1 to 3 with 1 being the highest priority).
This might give you an idea on how to proceed
Topic archived. No new replies allowed.