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);
	
	for(i = n - 1;i >= 0;i--){
		cout<<a[i];
	}
}

Pascal :

var a:array[1..100000] of longint;
i,j,n,t:longint;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
for j:=i+1 to n do
begin
if a[j]>a[i] then begin t:=a[i];a[i]:=a[j];a[j]:=t;end;
end;
for i:=1 to n do
write(a[i]);
end.

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();
		}
          getSum(a);
	}
	public static void getSum(int[] a){
		int t ;int sum = 0;
		for(int i = 1;i<a.length;i++){
			for(int j = 0;j<a.length-i;j++){
				if(a[j]<a[j+1]){
					t = a[j+1];
					a[j+1] = a[j];
					a[j] = t;
				}
			}
			
		}
		for(int i = 0;i<a.length;i++){
			sum = (int) (sum + a[i]*Math.pow(10, a.length-i-1));
		}
		System.out.println(sum);
	}

}

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()))
lst=list()
s.sort(reverse=True)
for item in s:
    lst.append(Node(item))
lst.sort()
for item in lst:
    print(item.id,end="")