题目：输入一个正整数数组，将它们连接起来排成一个数，输出能排出的所有数字中最小的一个。

For each test case, output the minimum number we can get after no more than M operations.

youdao

对于给定的n位正整数a和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。

For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few.

youdao

对于给定的n位正整数a和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。

For a given n-bit positive integer a and positive integer k, to design an algorithm to identify the composition of the remaining number of the smallest number of new programs to delete a few.

youdao