Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	scanner.Split(bufio.ScanWords)
	nums := make([]int, 5)
	for i := 0; i < 5; i++ {
		nums[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(nums)))
	for i, v := range nums {
		if i == len(nums)-1 {
			fmt.Printf("%d\n", v)
		} else {
			fmt.Printf("%d ", v)
		}
	}
}

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;
}

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;
}