How can we implement Priority Queue using HashMap(using key-value approach) in Rust

Question

How can we implement Priority Queue using HashMap in Rust?

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