PAT Grade B-B1023 Minimum Number of Groups (20)

Given numbers 0-9 each.You can arrange these numbers in any order, but you must use them all.The goal is to make the resulting number as small as possible (note that 0 cannot be the first).For example: given two 0s, two 1s, three 5s, and an 8, the smallest number we can get is 10015558.

Given a number, please write a program to output the smallest number that can be formed.

input format:

The input gives 10 non-negative integers in one line, in the order that we have the number 0, the number 1, ... the number 9.Separate integers with a space.The total number of 10 numbers does not exceed 50, and there is at least 1 non-zero number.

Output format:

Print the smallest number that can be formed on one line.

Input sample:

2 2 0 0 0 3 0 0 1 0

Example output:

10015558

#includeusing namespace std;int table[10];int main(){int h = 0, t;for(int i = 0; i < 10; ++i){cin >> t;table[i] = t;//Record the smallest integer as the first numberif(i && t && !h) h = i;}cout << h;table[h]--;for(int i = 0; i < 10; ++i)if(table[i])//Output from small to large, output one number and then output the next onewhile(table[i]){cout << i;table[i]--;}return 0;}