Implement priority queue in python using queue priorityqueue

1. import the necessary module:

3. add elements to the priority queue along with their priorities using the `put` method:

- `priority`: an integer value indicating the priority of the element.
- `element`: the element to be added to the priority queue.

4. retrieve elements from the priority queue using the `get` method:

- this will return and remove the element with the highest priority from the priority queue.

5. example code demonstrating the usage of priority queue:

in the above code, we create a priority queue and add three tasks with different priorities. we then retrieve and print the tasks in order of their priorities.

...

#python implement hash
#python implement in operator
#python implement interface
#python implement stack
#python implement len

python implement hash
python implement in operator
python implement interface
python implement stack
python implement len
python implement comparison operators
python implement context manager
python implement iterator
python implement queue
python implementations
python priority queue methods
python priority queue implementation
python priority queue peek
python priority queue get
python priority queue size
python priority queue max heap
python priority queue
python priority queue vs heapq