思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Гангстер одним ударом расправился с туристом в Таиланде и попал на видео18:08
，这一点在safew官方版本下载中也有详细论述
He also told Ball he may go back into the recording studio to work on "some things that are half-formed or were never finished".
I've rounded up the top three TV deals I could find heading into the weekend, with savings up to $1,100. Make note that while only one specific size of each TV is highlighted, most other sizes of each model are also discounted. Just click through to the different sizes on the product pages for more details.