Priority queue implementation using list

PriorityQueue.py

class PriorityQueue: 
    def __init__(self): 
        self.elements = []
 
    # add element to queue
    def enqueue(self, element): 
        self.elements.append(element) 
  
    # poll and return element based on priority
    # note that this is max pq
    def dequeue(self): 
        try: 
            Max = 0
            for i in range(len(self.elements)): 
                if self.elements[i] > self.elements[Max]: 
                    Max = i 
            element = self.elements[Max] 
            del self.elements[Max] 
            return element 
        except IndexError:  
            exit() 
        
    def isEmpty(self): 
        return self.elements == []