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 <stdio.h>
int main ()

{
    int number[30],i, j, a;
            for (i=0; i<5; ++i)
        scanf("%d",&number[i]);
            for (i=0; i<5; ++i)
                {
                    for (j=i+1; j<5; ++j)
                        {
                            if (number[i]<number[j])
                                {
                                    a=number[i];
                
                                    number[i]=number[j];
                
                                    number[j]=a;
                                }
                        }
                }
                    for (i=0; i<5; ++i)
                        {
                            printf("%d",number[i]);
                            if(i==4)
                                printf("\n");
                            else
                                printf(" ");
                        }
    
    return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

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

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

int main(){
	int a[5],i;
	for(i=0;i<5;i++){
		cin >> a[i];
	}
  sort(a,a+5,greater<int>()); 
	for(i=0;i<5;i++){
		cout << a[i] << ' ';
	}
	cout << endl;
  return 0;
}

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

using namespace std;

int main()
{
		int i, num;
        deque< int > index;
		int d[5];
		cin >> d[0] >> d[1] >> d[2] >> d[3] >> d[4];	   
	    for ( i = 0; i < 5; i++ ) {
              index.push_back( d[i] );
       }
       sort( index.begin(), index.end(), greater< int >() );

       deque< int >::iterator it = index.begin();
        for ( i = 0; i < 5; i++ ) {
              cout << *it;
			  if( i != 4 ){
				  cout << " ";
			  }
              it++;
       }
		cout << endl;

        return 0;
}

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

int main()
{
    int a[5];

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

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

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

using namespace std;

int main()
{
    int a,num=5;
    vector<int> ar;
    while(num--)
    {
        cin>>a;
        ar.push_back(a);
    }
    sort(ar.rbegin(),ar.rend());
    for(int i=0;i<ar.size();i++)
    {
        cout<<ar[i];
        if(i!=4)
            cout<<" ";
    }

    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int ara[5],i,j,temp;
    for(i=0; i<5; i++)
    {
        cin>>ara[i];
    }
    for(i=0; i<4; i++)
    {
        for(j=i+1; j<5; j++)
        {
            if(ara[i]<ara[j])
            {
                temp=ara[j];
                ara[j]=ara[i];
                ara[i]=temp;
            }
        }
    }
    for(i=0; i<5; i++)
    {
        cout<<ara[i]<<" ";
    }
}

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

using namespace std;

int main(void)
{
	int a,b,c,d,e;
	int kari[10];
	while(cin>>a>>b>>c>>d>>e)
	{
		deque<int> nums;
		nums.push_back(a);
		nums.push_back(b);
		nums.push_back(c);
		nums.push_back(d);
		nums.push_back(e);
		sort( nums.begin(), nums.end(), greater<int>() );
		deque<int>::iterator it = nums.begin();
		int i=0;
		while( it != nums.end() )
		{
			kari[i]=*it;
			++it,++i;
		}
		nums.clear();
		cout<<kari[0]<<" "<<kari[1]<<" "<<kari[2]<<" "<<kari[3]<<" "<<kari[4]<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(void){
    int a[5];
    for(int i=0; i<5; i++)  cin >> a[i];
    sort(a,a+5);
    cout << a[4];
    for(int i=3; i>=0; i--)
    cout << " " << a[i];
    cout << endl;
}

C++: #include <iostream>
#include <cstdio>
#include <stdlib.h>

using namespace std;

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

int main()
{
    int a[5];

    for(int i = 0; i < 5; i++) {
        scanf("%d", &a[i]);

        if (i != 4)
            printf(" ");
        
        else
            printf("\n");
    }  

    printf("\n");

    qsort (a, 5, sizeof(int), compare);

    for (int i = 0; i < 5; i++) {
        printf ("%d",a[i]);

        if (i != 4)
            printf(" ");
        
        else
            printf("\n");
    }

    return 0;
}

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

int main(){
  int a, b, c, d, e;
  vector<int> x;

  cin >> a >> b >> c >> d >> e;

  x.push_back(a);
  x.push_back(b);
  x.push_back(c);
  x.push_back(d);
  x.push_back(e);

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

  for(int i=0; i<x.size(); i++) {
    cout << x[i] << " ";
  }
  cout << "\n";

  return 0;
}

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

int main(){
	long int num[5];
	long int i,j,tmp;

	scanf("%ld",&num[0]);

	for(i = 1; i < 5; i++)
		scanf(" %ld",&num[i]);

	for(i = 0; i < 5; i++){
		for(j = 5; j > i; j--){
			if(num[j] > num[i]){
				tmp = num[j];
				num[j]  = num[i];
				num[i] = tmp;
			}
		}
	}

	for(i = 0; i < 4; i++)
		cout << num[i] << ' ';
	cout << num [4] << endl;

	return 0;
}

C++: #include <iostream>

using namespace std;
int main(void){
    // Here your code !
int a[5];

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

sort(a,a+5);

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

C++: #include<iostream>

using namespace std;

int main(void)
{
	int a[5];
	for(int i=0;i<5;i++){
		cin>>a[i];
	}
	for(int i=0;i<5;i++)
	{
		int max=i;
		for(int j=i+1;j<5;j++)
		{
			if(a[max]<a[j])
			{
				max=j;
			}
		}
		int tmp=a[i];
		a[i]=a[max];
		a[max]=tmp;
	}
	cout<<a[0];
	for(int i=1;i<5;i++)
	{
		cout<<" "<<a[i];
	}
	cout<<endl;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int b,i;
  vector <int> v;
  for(i=0;i<5;i++) {
    cin >> b;
    v.push_back(b);
  }
  sort(v.begin(),v.end(),greater<int>());
  cout << v[0];
  for(i=1;i<5;i++) cout << " " << v[i];
  cout << endl;
}

C++: #include<stdio.h>
int main()
{
int n[6]={},x;
for(int i=0;i<5;i++)
{scanf("%d",&n[i]);}
 
for(int i=0;i<5;i++){
for(int j=4;j>i;j--){
if(n[j]>n[j-1]){int t=n[j-1];n[j-1]=n[j];n[j]=t;}
}}
for(int i=0;i<5;i++)
{if(i>0)printf(" ");
printf("%d",n[i]);}
printf("\n");
return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <queue>
#include <vector>
#include <math.h>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
using namespace std;

int main(){
	priority_queue<int> q;
	for (int i = 0; i < 5; ++i) {
		int a;
		cin >> a;
		q.push(a);
	}
	for (int i = 0; i < 5; ++i) {
		cout << q.top() << ' ';
		q.pop();
	}
	cout << endl;
	return 0;
}