思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
반려견놀이터에 ‘낚싯바늘 빵’ 던져놓은 60대…“개 짖는 소리 시끄러워”
，详情可参考爱思助手下载最新版本
You don't have permission to access the page you requested.，这一点在91视频中也有详细论述
Jo Haywood first went to the Daventry Community Larder in Northamptonshire as a shopper and for the past two years has volunteered to run the service.
Paul Glynn and Helen BushbyCulture reporters