Template:cpp/algorithm/notes heap

A max heap is a range of elements that has the following properties:
 * With, for all , does not compare less than.
 * A new element can be added using std, in time.
 * The first element can be removed using std, in time.