B1023 group minimum

1023 Group a minimum number (20 branch )

Given number 0-9 There are several of them . You can arrange these numbers in any order , But all must be used . The goal is to make the final number as small as possible （ Be careful 0 Can't be the first ）. for example ： Given two 0, Two 1, Three 5, One 8, The smallest number we get is 10015558.
Now give the number , Please write a program to output the smallest number that can be composed .

Input format ：
Enter... On one line 10 Nonnegative integers , Order means we have numbers 0、 Numbers 1、…… Numbers 9 The number of . Integers are separated by a space .10 The total number of numbers does not exceed 50, And at least have 1 A non 0 The number of .

Output format ：
Output the smallest number that can be composed in one line .

sample input

2 2 0 0 0 3 0 0 1 0

sample output

10015558

Topic analysis ：

1. Record the number of occurrences
2. Note that in addition to 0 Outside the smallest number as the first , And write down the times minus one

The code is as follows ：

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a[10];
    for(int i=0;i<10;i++){
    	cin>>a[i];
	}
	for(int i=1;i<10;i++){
		if(a[i]!=0){
			cout<<i;
			a[i]--;
			break;
		}
	}
	for(int i=0;i<10;i++){
		for(int j=0;j<a[i];j++){
			cout<<i;
		}
	}
	
    return 0;
}