def pop(self):
        """Get the element with the highest priority.

        Get the element with the highest priority (i.e., smallest value).

        Returns
        -------
        The element with the highest priority.

        """
        return heapq.heappop(self._queue)[1]