cp_library/ds/heap/heappush_max_fn.py

• View this file on GitHub
• Last update: 2025-08-24 20:27:05+09:00

Depends on

• cp_library/ds/heap/heapsiftdown_max_fn.py

Required by

• cp_library/ds/heap/max_heap_cls.py
• cp_library/ds/heap/max_priority_queue_cls.py
• cp_library/ds/heap/min_k_heap_cls.py

Verified with

• test/atcoder/abc/abc249_f_min_k_heap.test.py
• test/library-checker/data-structure/double_ended_priority_queue_2heaps_fast_heapq.test.py

Code

import cp_library.__header__
import cp_library.ds.__header__
import cp_library.ds.heap.__header__
from cp_library.ds.heap.heapsiftdown_max_fn import heapsiftdown_max

def heappush_max(heap: list, item):
    heap.append(item); heapsiftdown_max(heap, 0, len(heap)-1)

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''



def heapsiftdown_max(heap: list, root: int, pos: int):
    item = heap[pos]
    while root < pos and heap[p := (pos-1)>>1] < item: heap[pos], pos = heap[p], p
    heap[pos] = item

def heappush_max(heap: list, item):
    heap.append(item); heapsiftdown_max(heap, 0, len(heap)-1)

Back to top page