Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
using namespace std;

int main(){
	int a[5];
	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
	sort(a, a + 5, greater<int>());
	int i;
	for(i = 0; i < 4; i++)cout << a[i] << " ";
	cout << a[4] << endl;
}

C++: #include <cstdio>
#include <algorithm>
using namespace std;

bool big_order(int a, int b){return (a>b);}

int main(int argc, char *argv[]) {
	int array[5];
	
	fscanf(stdin, "%d %d %d %d %d", &array[0], &array[1], &array[2], &array[3], &array[4]);
	sort(array, array+sizeof(array)/sizeof(int), big_order);
	for (int i = 0; i < 5; i++) {
		printf("%d ", array[i]);
	}
	fflush(stdout);
	printf("\n");
	return 0;
}

C++: #include <iostream>
using namespace std;

int main(int argc, char *argv[]){
	int a[5];
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
	for (int j = 0; j < 5; ++j){
		for (int i = 0; i < 4; ++i){			
			if(a[i]<a[i+1]){
				int tmp;
				tmp=a[i];
				a[i]=a[i+1];
				a[i+1]=tmp;
			}
		}
	}
	for (int i = 0; i < 4; ++i){
		cout<<a[i]<<" ";	
	}
	cout<<a[4]<<endl;
    return 0;
}

C++: #include <iostream>

int main(){
	
	int a[5];
	int s[5];
	for(int r=0;r<5;r++){
		s[r]=0;
	}
	for(int b=0;b<5;b++){
		std::cin>>a[b];
		if(a[b]>s[0]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=s[0];
			s[0]=a[b];
		}else if(a[b]>s[1]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=a[b];
		}else if(a[b]>s[2]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=a[b];
		}else if(a[b]>s[3]){
			s[4]=s[3];
			s[3]=a[b];
		}else{
			s[4]=a[b];
		}
	}
	for(int q=0;q<5;q++){
		std::cout<<s[q];
		if(q!=4){
			std::cout<<" ";
		}
	}
	std::cout<<std::endl;
	return 0;
}

C++: #include<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<stack>
#include<set>
#include<cmath>

#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)

#define EPS 1e-6

using namespace std;


int main(){

vector<int>v;
int a;
rep(i,5){

cin >> a;
v.push_back(a);

}

sort(v.begin(),v.end(),greater<int>());

cout << v[0] << " " << v[1] << " " << v[2] << " " << v[3] << " " << v[4] << endl;

return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<functional>

using namespace std;

int main(){

	int a[5];
	
	for(int i=0;i<5;i++)
		scanf("%d",&a[i]);
		
	sort(a,a+5,greater<int>());
	
	for(int i=0;i<5;i++){
		
		if(i>0)
			printf(" ");
			printf("%d",a[i]);
		
		
		
	}

	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <iostream>

using namespace std;

int n[5];

int cmp(const void *a, const void *b) {
	return *(int *)b - *(int *)a;
}

int main() {
	while (scanf("%d%d%d%d%d", &n[0], &n[1], &n[2], &n[3], &n[4]) != EOF) {
		qsort(n, 5, sizeof(int), cmp);
		for (int i=0; i<5; ++i) {
			printf (i ? " %d" : "%d", n[i]);
		}
		puts("");
	}
	return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<string>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 999999

using namespace std;

typedef long long ll;


int main()
{
	int a[6];
	for (int i = 0; i < 5; i++) {
		cin >> a[i];
	}

	sort(a, a + 5,greater<int>());

	for (int i = 0; i < 4; i++) {
		cout << a[i] << " ";
	}
	cout << a[4] << endl;
	
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
signed main(){
        int a,b,c,d,e;
        while( scanf("%lld %lld %lld %lld %lld", &a, &b, &c, &d, &e) != EOF ){
                vector<int> data{a,b,c,d,e};
                sort(data.begin(), data.end());
                printf("%lld %lld %lld %lld %lld\n", data[4], data[3], data[2], data[1], data[0]);
        }
        return 0;
}

C++: #include<iostream>
#include<algorithm>

int main(void){
    int a[5];
    for(int i=0;i<5;i++) std::cin>>a[i];
    std::sort(a,a+5);
    for(int i=4;i>=0;i--) std::cout<<a[i];


    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>

using namespace std;

int main() {
	long long int a,b,c,d,e;
	int s[5];
	cin >> a>>b>>c>>d>>e;
	s[0]=a;
	s[1]=b;
	s[2]=c;
	s[3]=d;
	s[4]=e;
	for(int i=4;i>=0;i--)
		cout << s[i] << " ";
	
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
int a[5];
int biggest[5];
cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
biggest[0]=a[0];
for(int i=1;i<5;i++){
for(int j=0;j<i;j++){
if(a[i]>biggest[j]){
for(int k=i;k>j;k--){
biggest[k]=biggest[k-1];}
biggest[j]=a[i];
break;}}}
for(int i=0;i<5;i++){
if(i!=4){
cout<<biggest[i]<<" ";}
if(i==4){
cout<<biggest[i];}
}}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int          input;
    vector<int>  array;
    for (int i=0; i<5; ++i) {
        cin >> input;
        array.push_back(input);
    }
    sort(array.begin(), array.end(), greater<int>());
    for (vector<int>::size_type i=0; i<array.size(); ++i) {
        cout << array[i];
        cout << (i==4 ? '\n' : ' ');
    }
}

C++: #include<iostream>
using namespace std;

int main(){
int a[5];
int biggest[5];
cin>>a[0]>>a[1]<<a[2]<<a[3]<<a[4];
biggest[0]=a[0];
for(int i=1;i<5;i++){
for(int j=0;j<i;j++){
if(a[i]>biggest[j]){
for(int k=i;k>j;k--){
biggest[k]=biggest[k-1];}
biggest[j]=a[i];
break;}}}
for(int i=0;i<5;i++){
cout<<biggest[i]<<" ";}}

C++: #include<stdio.h>
#include<vector>
#include<algorithm>//sort
#include<map>//pair
using namespace std;

int main(){
  char c[6];
  char dummy;
  int i;
  for(i=0;i<5;i++){
    c[i]=getchar();
    dummy=getchar();
  }
  c[5]='\0';
  sort(c,c+5);
  printf("%s\n",c);
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int          input;
    vector<int>  array;
    for (int i=0; i<5; ++i) {
        cin >> input;
        array.push_back(input);
    }
    sort(array.begin(), array.end(), greater<int>());
    for (vector<int>::size_type i=0; i<array.size(); ++i) {
        cout << array[i];
        cout << (i==4 ? '\n' : ' ');
    }
}

C++: #include <iostream>
using namespace std;

int main() {
	int a,b,c,d,e;
	cin>>a>>b>>c>>d>>e;
	int num[]={a,b,c,d,e};
	for(int i=0;i<5;i++)
		for(int j=0;j<5;j++)
			if(num[i]<num[j])
				swap(num[i],num[j]);
	for(int i=0;i<5;i++)
		cout<<num[i];
	cout<<endl;
}

C++: #include <algorithm>
#include <functional>
#include <iostream>
using namespace std;

int main(void){
	int a[5];
	int i;

	for(i=0; i<5; i++){
		scanf("%d", &a[i]);
	}
	sort(a, a+5, greater<int>());
	for(i=0; i<4; i++){
		printf("%d ", a[i]);
	}
	printf("%d\n", a[4]);

	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main() {
	int num[5];
	for (int i = 0; i < 5; ++i) {
		cin >> num[i];
	}

	sort(num, num + 5);

	cout << num[4] << " " << num[3] << " " << num[2] << " " << num[1] << " " << num[0] << endl;
}