思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Последние новости。关于这个话题，WPS下载最新地址提供了深入分析
，详情可参考爱思助手下载最新版本
It is understood the majority of cuts will impact the UK, where the bulk of Aston Martin's workers are based, with roles across the business being impacted, including factory staff.，详情可参考Line官方版本下载
And now, look at him go!
The built-in editor shows how in-depth your topic is covered and what needs improvement