问题描述：

给定n位正整数a，去掉其中任意k个数字后，剩下的数字按原次序排列成一个新的正整数。



算法设计：

给定n (1<=n<=200)位的正整数a和k，此时，k小于n。

试着设计一个算法，找出删去k个数，剩下数字组成的新数最小的删数方案。-Descr iption of the problem: given n-bit positive integer a, which removed the arbitrary k-figures, the remaining figures as originally arranged in the order of a new positive integer. Algorithm design: a given n (1 <= n <= 200)-bit positive integers a and k, at this time, k is less than n. Try to design an algorithm to find k by deleting the number, the remaining digits of the new cut the number of the smallest programs.