给定n位整数任意去掉其中k<=n位，剩下的数字按原次序排列组成一个新的正整数，且这个正整数最小-Given an arbitrary n-bit integers to remove where k < = n bits, the remaining number of original order of the formation of a new positive integer, and that this is the smallest integer