code: def kvp_minheap_sort(sp, ep, keys, vals):
      """
      Sort a heap-organized array subset by decreasing values.
  
      Args:
          sp(int): the start of the heap (inclusive).
          ep(int): the end of the heap (exclusive).
          keys: the key array
          vals: the value array
      """
  
      for i in range(ep - 1, sp, -1):
          swap(keys, i, sp)
          swap(vals, i, sp)
          _pair_downheap(0, sp, i - sp, keys, vals)
  
imports: from numba import njit
  from .array import swap
label_desc: Use image node_id 4 for calling a global function with example usage: kvp_minheap_sort(sp, ep, keys, vals) without return types