function maxPQ() {
let pq = []
let len = 0
let max = () => {
if(len>1)
return pq[1]
}
let exchange = (i, j) => {
let temp = pq[i]
pq[i] = pq[j]
pq[j] = temp
}
let less = (i, j) => {
return pq[i] < pq[j]
}
let insert = () => {
}
let delMax = () => {
}
let swim = (k) => {
}
let sink = (k) => {
}
}