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 <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;
 
#define rep(i,n) for(int i=0;i<int(n);++i)
 
static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;
static const double eps = 1e-8;
 
vector<int> a;
int t;

int main(){
	while(cin>>t){
		a.push_back(t);
	}
	sort(a.begin(),a.end());
	int n=a.size();
	cout<<a[(n--)-1];
	a.pop_back();
	while(!a.empty()){
		cout<<" "<<a[(n--)-1];
		a.pop_back();
	}
	cout<<endl;
	return 0;
}

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

using namespace std;
int main()
{
	int i, j;
	int num[5];
	
	for(i = 0; i < 5; i++)
	{
		cin >> num[i];
	}
	
	stable_sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 5; i++)
	{
		cout << num[i] << " ";
	}
		
		cout << endl;
	
	return 0;
}

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

int number[5];

void bubble(){
	for(int i = 0; i < 4; i++){
		for(int j = i + 1; j < 5; j++){
			if(number[i] < number[j])	swap(number[i], number[j]);
		}
	}
}

int main(void){
	for(int i = 0; i < 5; i++){
		cin >> number[i];
	}
	bubble();
	for(int i = 0; i < 5; i++){
		cout << number[i];
		if(i != 4)	cout << " ";
	}
	cout << endl;
  return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<stdio.h>

using namespace std;


int main(){

	int x[5];

	for (int i = 0; i < 5; i++){
		cin >> x[i];
		x[i] *= (-1);
	}

	sort(x, x + 5);

	printf("%d %d %d %d %d\n", -x[0], -x[1], -x[2], -x[3], -x[4]);

	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;}}}
cout<<biggest[0]<<" "<<biggest[1]<<" "<<biggest[2]<<" "<<biggest[3]<<" "<<biggest[4];
}

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


int main(void)
{
	int a[5] = {};
	for(int i = 0 ; i < 5 ; i++){
		scanf("%d",&a[i]);
	}
	sort(a,a+5);
	for( int q = 4 ; q >=0 ; q--){
		printf("%d ",a[q]);
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

ll a;
V vi;

int main(){
	REP(i, 5){
		cin >> a;
		vi.push_back(a);
	}
	sort(ALL(vi), greater<int>());
	REP(i, 5){
		cout << vi[i];
		if (i == 4)cout << endl;
		else cout << " ";
	}
}

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

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

int main() {
	int n[5],tmp;
	scanf("%d %d %d %d %d",&n[0],&n[1],&n[2],&n[3],&n[4]);
	for (int i=0; i<4; i++)
	{
		for (int j=0; j<4-i; j++)
		{
			if (n[j]<n[j+1])
			{
				tmp = n[j];
				n[j] = n[j+1];
				n[j+1] = tmp;
			}
		}
	}
	cout << n[0] << " " << n[1] << " " << n[2] << " " << n[3] << " " << n[4] << endl;
	return 0;
}

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

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

	for(int i = 0; i < 5; i++)
		cin >> d[i];
	sort(d,d+5);
	cout << d[4];
	for(int i = 3; i >= 0; i--)
		cout << ' ' << d[i];
	cout << endl;


	return 0;
}

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

int main()
{
    int Number[5];
    int Temp;

    while(cin >> Number[0] >> Number[1] >> Number[2] >> Number[3] >> Number[4])
    {
        for(int x = 0; x < 5; x++)
        {
            for(int z = 0; z < 5; z++)
            {
                if(Number[z] < Number[z+1])
                {
                    Temp = Number[z+1];
                    Number[z+1] = Number[z];
                    Number[z] = Temp;
                }
            }
        }

        for(int y = 0; y < 5; y++)
        {
            cout << Number[y] << " ";
        }


    }

}

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

using namespace std ;

int a[4] ;

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

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 (unsigned int i=0; i<5; ++i) {
        cout << array[i];
        if (i!=array.size()-1) cout << ' ';
    }
}

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

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);
  printf("%d %d %d %d %d\n", a[4], a[3], a[2], a[1], a[0]);
}

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

using namespace std;

int main() {
    int arr[5];
    for(int i = 0; i < 5; ++i) cin >> arr[i];
    sort(arr, arr+5);
    for(int i = 4; i >= 0; --i) {
        cout << arr[i];
        if(i != 0) cout << ' ';
    }
    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, greater<int>());
	for(int i = 0; i < 5; i++){
		if(i == 4){
			cout << a[i];
		}
		else cout << arr[i] << " ";
	}
	cout << endl;
	return 0;
}

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

using namespace std;

int line[5];

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

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