思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
would end up talking to a teller who simply keyed the transaction into a 3604,
。safew官方版本下载是该领域的重要参考
Раскрыты подробности похищения ребенка в Смоленске09:27。91视频对此有专业解读
"As young as I am, it feels almost a bit crazy. Like, I'm not really legendary enough to be receiving it - but you know, I will definitely take it!"