给定n 位正整数a，去掉其中任意k≤n 个数字后，剩下的数字按原次序排列组成一个新的正整数。对于给定的n位正整数a 和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。对于给定的正整数a，编程计算删去k个数字后得到的最小数。-Given n-bit positive integer a, to remove any of them k ≤ n digits after the original order of the remaining figures to form a new positive integer. For a given n-bit positive integers a and positive integer k, design an algorithm to find the remaining digits of the number of the smallest deletion the number of new programs. For a given positive integer a, calculated by deleting the k-programmed to be the minimum number of figures.