Solution: Find k Smallest Elements in a List

Statement

Given an unsorted list lst and an integer k, find the k smallest elements from the list using a Heap.

Constraints:

• $1 \leq$ lst.length $\leq 10^3$
• $1 \leq$ k $\leq 10^3$