We want to find the biggest previously `yi - xi` for each `point_j = (xj, yj)`.\n\n```\n\tmaxHeap = new MaxHeap  // max heap evaluates the point by the point\'s y - x\n\tres = -infinity\n\tfor point in points:\n\t\twhile (maxHeap is not empty) && (point.x - maxHeap.top.x > k)  // maxHeap.top.x is the heap top point\'s x value.\n\t\t\tmaxHeap.pop()\n\t\tif (maxHeap is not empty):\n\t\t\tres = max {res, maxHeap.top.value + point.y + point.x}\n\t\tmaxHeap.push(point)\n\treturn res\n```

We want to find the biggest previously yi - xi for each point_j = (xj, yj).\n\n\n\tmaxHeap = new MaxHeap  // max heap evaluates the point by the point\'s y - x\