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>

using namespace std;

int main()
{
	int num[5];
	
	for (int i = 0; i < 5; i++){
		cin >> num[i];
	}
	
	for (int i = 0; i < 5; i++){
		for (int j = 0; j < 5; j++){
			if (num[i] >= num[j]){
				swap(num[i], num[j]);
			}
		}
	}
	
	cout << num[0];
	for (int i = 1; i < 5; i++){
		cout << " " << num[i];
	}
	cout << endl;
	
	return (0);
}

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

using namespace std;

int main()
{
	int a[5];

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

		for (int j = (i - 1); j >= 0; j--)
		{
			if (a[j] < a[j + 1])
			{
				swap(a[j], a[j + 1]);
			}
		}
	}

	cout << a[0] << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << ' ' << a[4] << endl;
	
	return 0;
}

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

int main(int argc, char *argv[]){
  using namespace std;
  vector<int> res;
  for (int i=0; i<5; ++i){
    int data;
    cin >> data;
    res.push_back(data);
  }
  sort(res.begin(), res.end(), greater<int>());
  vector<int>::iterator it = res.begin();
  while (it != res.end()){
    cout << *it;
    ++it;
    if (it != res.end()){
      cout << " ";
    }
    else{
      cout << endl;
    }
  }
  return 0;
}

C++: 
#include<stdio.h>

int Counting_sort(int A[], int k, int n)
{
    int i=0, j=0;
    int B[15], C[100];
    for(i = 0; i <= k; i++)
            C[i] = 0;
    for(j =1; j <= 5; j++)
            C[A[j]] = C[A[j]] + 1;
    for(i = 1; i <= k; i++)
            C[i] = C[i] + C[i-1];
    for(j = n; j >= 1; j--)
    {
            B[C[A[j]]] = A[j];
            C[A[j]] = C[A[j]] - 1;
    }

    for(i = 5; i >=1; i--)
    {
        if(i==1)
            printf("%d\n",B[i]);
        else
            printf("%d ",B[i]);
    }

}

int main()
{
    int n=0,i=0,k = 0, A[15]={0};
    while(1)
    {


    for ( i = 1; i <= 5; i++)
    {
         scanf("%d",&A[i]);
         if(A[i] > k)
         {
            k = A[i];
         }
    }
    Counting_sort(A, k, 5);
    }
     return 0;
}

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

int main() {
	int a[5];
	for(int i=0; i<5; i++){
		cin >> a[i];
	}
	for(int j=0; j<5; j++){
		int v = a[j];
		int k = j-1;
		while(a[k]<v && k>=0){
			a[k+1] = a[k];
			k--;
			a[k+1] = v;
		}
	}
	for(int l=0; l<4; l++){
		cout << a[l] << ' ';
	}
	cout << a[4] << endl;
	return 0;
}

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

int main(){
	priority_queue<int> que;
	for(int i = 0;i < 5;i++){
		int a;
		cin >> a;
		que.push(a);
	}
	while(!que.empty()){
		if(que.size() > 1)
			cout << que.top() << " ";
		else
			cout << que.top();
		que.pop();
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	vector<int> v(5);
	REP(i, 0, 5) cin >> v[i];
	SORT(v);
	for (int i = 4; i > -1;i--) {
		if(i!=0)  cout << v[i] <<" ";
		else cout << v[i] << endl;
	}

	return 0;
}

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

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  vector<int> a(5);
  for (int i = 0; i < 5; i++) {
    cin >> a[i];
  }
  sort(a.rbegin(), a.rend());
  for (int i = 0; i < 5; i++) {
    cout << a[i] << " \n"[i + 1 == 5];
  }

  return 0;
}

C++: #include<stdio.h>
int main(void){
int a[10],i,j,k,l,m,run;

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

C++: #include <stdio.h>

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

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

for (int i = 0; i < 5; i++){
for (int j = i + 1; j < 5; j++){
if (a[i] < a[j]){
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
}
}

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

return (0);
}

C++: #include <algorithm>
#include <string.h>
#include <cmath>
#include <stdio.h>

using namespace std;

int main()
{
	int a[5];
	while(1){
		for(int i = 0; i < 5; i++){
			if(scanf("%d",&a[i]) == EOF){
				return 0;
			}
		}
		sort(a,a+5);
		for(int i = 4; i > 0; i--){
			printf("%d ",a[i]);
		}
		printf("%d\n",a[0]);
	}
	return 0;
}

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

int main() {
	int a[5];
	scanf("%d%d%d%d%d",a+0,a+1,a+2,a+3,a+4);
	sort(a,a+5,greater<int>());
	printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
	return 0;
}

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

int main() {
	int a, b, c, d, e;
	cin >> a >> b >> c >> d >> e;
	vector<int> num{a, b, c, d, e};
	sort(num.begin(), num.end(),greater<int>());
	for (int i = 0; i < 5; i++) {
		if (i != 4)cout << num[i] << " ";
		else cout << num[i];
	}
	cout << endl;
	return 0;
}

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

int main()
{
	int number[5];
	cin >> number[0] >> number[1] >> number[2] >> number[3] >> number[4];

	for(int i=0;i<5;i++)
	{
		for(int j=4;j>i;j--)
		{
			if(number[j] > number[j-1])
			{
				int temp = number[j];
				number[j] = number[j-1];
				number[j-1] = temp;
			}
		}
	}

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

	return 0;
}

C++: /*Filename: aoj0018.cpp
 *Author: Mushiyo
 */

#include <iostream>
#include <algorithm>

using namespace std;

const int SIZE = 5;

int main(){
	int firstNum = 0;

    while(cin >> firstNum){
        int num[SIZE];

        num[0] = firstNum;
        for(int i = 1; i < SIZE; ++i){
        	cin >> num[i];
        }

        sort(num, num + SIZE, greater<int>());
        
        cout << num[0];
        for(int i = 1; i < SIZE; ++i){
        	cout << " " << num[i];
        }
        cout << endl;
    }

	return 0;
}

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

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

int main(){
	int a[5];

	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];

	for ( int i = 0; i < 4; ++i ){
		for ( int j = 0; j < 4-i; ++j ){
			if ( a[ j ] < a[ j + 1 ] ){
				int t = a[ j ];
				a[ j ] = a[ j + 1 ];
				a[ j + 1 ] = t;
			}
		}
	}

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

	return 0;
}