思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
FT Weekend Print delivery，推荐阅读同城约会获取更多信息
，推荐阅读快连下载安装获取更多信息
"It won't happen in two years, but we might be talking about 10 years for this to happen, and that's still a short period of time," he says.
But I think a lot of people weren’t concerned either way.，推荐阅读体育直播获取更多信息