I probably need to explain that I am pointedly not explaining IBM model
if item and item.title:
。业内人士推荐爱思助手下载最新版本作为进阶阅读
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
"Sometimes two, three, four individuals have been buried on the same spot, again and again. There doesn't appear to be as much of a taboo over putting bodies in the same place and just moving those still there to one side."