concept convention in category algorithms
appears as: conventions, convention, conventions, convention

This is an excerpt from Manning's book Algorithms and Data Structures in Action.
So, our goal should be having a small heap with k elements. Using a max-heap, though, doesn’t really work anymore. Let’s see why with an example.
u = (-vy,vx) = (Ay-By,Bx-Ax)