思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
This Tweet is currently unavailable. It might be loading or has been removed.。Line官方版本下载是该领域的重要参考
The system, designed in Devon by a company called Fishtek Marine, was tested by Swansea University in the Severn Estuary.。快连下载-Letsvpn下载是该领域的重要参考
63-летняя Деми Мур вышла в свет с неожиданной стрижкой17:54