```python
import heapq

def heap_replace(heap, a):
  """
  Deletes the smallest element from the given heap and then inserts a new item.

  This function is an efficient way to pop the smallest item and push a new
  item in one step. The heap size remains unchanged.

  Args:
    heap: A list representing a min-heap.
    a: The new item to be inserted.

  Returns:
    The smallest item that was removed from the heap.
  """
  return heapq.heapreplace(heap, a)
```