Descending based Priority Queue with less complexity

PriorityQueue.js

/**
* Descending based Priority Queue with less complexity
**/

class PriorityQueue {
	constructor() {
		this.queue = [];
	}
	enqueue(element) {
        this.queue=[...this.queue, element].sort(([ v, p ], [ v1, p1 ]) => p1 - p);
        // this.queue.push(element).sort(([ v, p ], [ v1, p1 ]) =>p1 - p);
	}
	dequeue() {
		return this.queue.shift();
	}
	isEmpty() {
		return this.queue.length === 0;
	}
}