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>
using namespace std;

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

	for(i = 0; i < 5; i++)
		cin >> 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 <cstdio>
#include <algorithm>

using namespace std;

int main()
{
	int num[5];
	
	for (int i = 0; i < 5; i++){
		scanf("%d", &num[i]);
	}
	
	sort(num, num + 5);
	reverse(num, num + 5);
	
	for (int i = 0; i < 4; i++){
		printf("%d ", num[i]);
	}
	
	printf("%d\n", num[4]);
	
	return (0);
}

C++: #include<stdio.h>
#define n 5

int main(void)
{
	int a[n],i,j,t;

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

	for( i = 1; i < n; ++i )
	{
		t = a[i];
		for( j = i; j > 0 && a[j-1] > t; --j )
		{
			a[j] = a[j-1];
		}
		a[j] = t;
	}
	for(i=n-1;i>-1;i--)
		printf("%d ",a[i]);
	printf("\n");
  return 0;
}

C++: //#define _USE_MATH_DEFINES
//#include <cmath>
#include <iostream>
//#include <stdio.h>
//#include <stdlib.h>
//#include <iomanip>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <time.h>
//#include <sstream>
#include <queue>

using namespace std;


int main(){

	int buf;
	priority_queue <int> pq;

	while (cin >> buf){
		pq.push(buf);
	}

	while (pq.size()>1){
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << pq.top() << endl;

	return 0;
}

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

void swap(int *x,int *y){

    int tmp;
    
    tmp=*x;
    *x=*y;
    *y=tmp;
    return;
}

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

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

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

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

using namespace std;

int main()
{

  int i,temp;
  vector<int> suuretu;
  
  for(i=0;i<5;i++){
    cin >>temp;
    suuretu.push_back(temp);
  }
  
  sort(suuretu.begin(),suuretu.end());
  
  for(i=0;i<5;i++){
    if (i==0)
      cout << suuretu[4-i];
    else
      cout << " " << suuretu[4-i];
  }
  cout << endl;

  return 0;
}

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

using namespace std;

namespace sorting_five_numbers
{
    class SortingFiveNumbers
    {
    private:
        //! データサイズ
        static const int Size = 5;

        //! 入力値
        int dataList[Size];

    public:
        /**
        * @brief コンストラクタ
        */
        SortingFiveNumbers(int target[]) {
            memset(dataList, 0, Size);

            for (int i = 0; i < Size; i++) {
                dataList[i] = target[i];
            }
        }

        /**
        * @fn int* createDescendingList()
        * @brief 降順にソートしたリストを生成する
        * @return int* ソート済みリスト
        */
        int* createDescendingList();
    };

    class Control
    {
    private:
        //! データサイズ
        static const int Size = 5;

    public:
        /**
        * @fn bool executeEx()
        * @brief 5つの整数を読み込み、降順に整列し出力する
        * @return bool 入力値が範囲内ならtrueを、そうでなければfalseを返す
        */
        bool executeEx();

    private:
        /**
        * @fn void read(int target[])
        * @brief 標準入力から読み込む
        * @param[out] target 入力データ
        */
        void read(int target[]);

        /**
        * @fn void write(int target[])
        * @brief 標準出力に書き込む
        * @param[in] target 出力データ
        */
        void write(int target[]);

        /**
        * @fn bool check(int target[])
        * @brief 入力データが範囲内か調べる
        * @param[in] target 調査対象
        * @return bool 入力データが範囲内ならtrueを、そうでなければfalseを返す
        */
        bool check(int target[]);
    };
}

using namespace sorting_five_numbers;

int* SortingFiveNumbers::createDescendingList()
{
    for (int i = 0; i < Size - 1; i++) {
        int max = i;
        for (int j = i + 1; j < Size; j++) {
            if (dataList[max] < dataList[j]) {
                max = j;
            }
        }
        int t = dataList[i];
        dataList[i] = dataList[max];
        dataList[max] = t;
    }

    return dataList;
}

bool Control::executeEx()
{
    int input[Size] = { 0 };
    int* output = NULL;

    read(input);

    if (!check(input))
        return false;

    SortingFiveNumbers list(input);

    output = list.createDescendingList();

    write(output);

    return true;
}

void Control::read(int target[])
{
    for (int i = 0; i < Size; i++)
        cin >> target[i];
}

void Control::write(int target[])
{
    for (int i = 0; i < Size; i++) {
        (i != Size) ? cout << target[i] << " " : cout << target[i] << endl;
    }
}

bool Control::check(int target[])
{
    static const int Min = -100000;
    static const int Max = 100000;

    for (int i = 0; i < Size; i++) {
        if (Min > target[i] || Max < target[i])
            return false;
    }

    return true;
}

int main()
{
    if (!Control().executeEx())
        return 1;
}

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, greater<int>() );
for(int i=0; i<5; i++) printf("%d ",a[i]);
cout << endl;
return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
          int a[100000],c,i,j;
          for(i=0;i<5;i++)
          {
                    cin>>a[i];
          }
          for(i=0;i<5-1;i++)
          {
                    for(j=0;j<5-i-1;j++)
                    {
                              if(a[j]>a[j+1])
                              {
                                        c=a[j];
                                        a[j]=a[j+1];
                                        a[j+1]=c;
                              }
                    }
          }

                    cout<<a[4]<<" ";
                    cout<<a[3]<<" ";
                    cout<<a[2]<<" ";
                    cout<<a[1]<<" ";
                    cout<<a[0]<<"\n";
return 0;
}

C++: l = map(int, raw_input().strip().split(" "));
print " ".join(sorted(l, lambda x, y: y - x));

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() {
	vector<int> a(5);
	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
	sort(a.rbegin(), a.rend());
	cout << a[0] << " " << a[1] << " " << a[2] << " " << a[3] << " " << a[4] << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int num[5];
	cin>>num[0]>>num[1]>>num[2]>>num[3]>>num[4];
	int a;
	for(int i=0;i<4;i++){
		for(int j=i+1;j<=4;j++){
			if(num[i]<num[j]){
				a = num[i];
				num[i] = num[j];
				num[j] = a;
			}
		}
	}
	for(int k=0;k<5;k++){
		if(k != 0) cout<<" ";
		cout<<num[k];
	}
	cout<<endl;
	return 0;
}