Priority Queue Implementation using HashMap in Rust

Question

I have to implement Priority Queue using HashMap.

pub trait PQ {
fn new() -> Self;
fn insert(&mut self, element: Element, p: u64);
fn pe