Numeric Identifier Minimization

A warehouse labels every parcel with a positive decimal identifier. You may erase exactly k digits from the label while keeping every remaining digit in its original order. After the erasures, leading zeroes do not contribute to the identifier. Return the smallest possible non-empty decimal identifier.

If every digit is erased, return "0". The result must not contain leading zeroes unless it is exactly "0".

Examples
Input: ["1432219",3]
Output: "1219"
Hints
Related Problems

Numeric Identifier Minimization

A warehouse labels every parcel with a positive decimal identifier. You may erase exactly `k` digits from the label while keeping every remaining digit in its original order. After the erasures, leading zeroes do not contribute to the identifier. Return the smallest possible non-empty decimal identifier.