C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,x,a[100],i;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
	}
	sort(a,a+n);
	
	int p = 0;
	for(i = 0;i < n;i++){
		if(a[i] != 0){
			p = i;
			break;
		}
	}
	
	int t = a[0];
	a[0] = a[p];
	a[p] = t;
	
	for(i = 0;i < n;i++){
		cout<<a[i];
	}
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for(int i = 0 ; i < n ; i++)
        {
        	a[i] = sc.nextInt();
        }
        //冒泡排序
        int t = 0;
    	for(int i = 1;i <= n - 1;i++){
            for(int j = 0;j <= n - i - 1;j++){
                if(a[j] > a[j+1]){
                    t = a[j];
                    a[j] = a[j+1];
                    a[j+1] = t;
                }
            }
        }

        for(int i = 0 ; i < n ; i++)
        {
        	if(a[i] != 0)
        	{
        		int s = a[i];
        		a[i] = a[0];
        		a[0] = s;
        		break;
        	}
        }

        
        for(int i = 0 ; i < n ; i++){
        System.out.print(a[i]);}
    }
}

Python :

class Node:
    def __init__(self,id):
        
        self.id=id
    def __lt__(self,other):
        if str(self.id)+str(other.id)<str(other.id)+str(self.id):
            return True
            
n=int(input())
s=list(map(int,input().split()))
ling_num=s.count(0)
s=[item for item in s if item>0]

alist=list()
for item in s:
    alist.append(Node(item))

alist.sort()
print(alist[0].id,end="")
print("0"*ling_num,end="")
for i in range(1,len(alist)):
    print(alist[i].id,end="")