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)])
}

Python: l=input().split(" ")
l.sort(reverse=True)
print(int(l[0]),int(l[1]),int(l[2]),int(l[3]),int(l[4]))

Python: print(*reversed(list(map(int,input().split()))))

Python: a=input().split(" ")
a.sort()
for i in a[::-1]:
    print(i,end='')

Python: print(' '.join(map(str, sorted(map(int, input().split())))))

Python: while True:
    a = list(map(int, (input().split())))
    a = sorted(a, reverse=True)
    for i in range(4): print(a[i],end=' ')
    print(a[4])

Python: numList = list(map(int, input().split()))

numList.sort(reverse=True)

print(' '.join(map(str, numList)))

Python: A=[int(i) for i in input().split()]
A.sort(reverse=True)
print(" ".join(map(str,A)))

Python: a=sorted([int(i) for i in input().split()],reverse=True)
print(" ".join(map(str,a)))

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>

using namespace std;

int main() {

	int no[5];

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

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

	for (int i = 0; i < 5; i++)
		cout << no[i] << ' ';
	putchar('\n');

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

int main(void){
  int a[5];
  rep(i,5)cin>>a[i];
  sort(a,a+5,greater<int>());
  rep(i,5)cout<<a[i]<<(i!=4?' ':'\n');
}

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

using namespace std;

int main()
{
    int input[5];

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

    sort(input, input + 5, greater<int>());

    for (int i = 0; i < 5; i++)
        if (i != 4)
            cout << input[i] << " ";
    cout << endl;
//    cout << input[0] << " " << input[1] << " " << input[2] << " " << input[3];
//    cout << " " << input[4] << endl;


    return 0;
}

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

inline void swap(int a[], int i, int j){
	int t = a[i]; a[i] = a[j]; a[j] = t;
}

void selection(int a[], int N)
{
	int i, j, min;
	for(i = 1; i < N; i++){
		min = i;
		for(j = i + 1; j <= N;j++)
			if(a[min] > a[j]) min = j;
		swap(a, min, i);
	}
}

int main(){
	int a[6];
	for(int i = 1; i <= 5; i++){
		int n;
		cin >> n;
		a[i] = n;
	}
	selection(a, 5);
	for(int i = 5; i > 1; i--)
		cout << a[i] << " ";
	cout << a[1] << endl;
}

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

int main(){
    int n;
    int a[5];
    for(int i=0 ; i < 5 ; i++ ){
        cin >> a[i];
    }
    sort( a , a+5 );
    for(int i=4 ; i >= 0 ; i-- ){
        if( i != 4 ) cout << " ";
        cout << a[i];
    }
    cout << endl;
}

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

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

    return (0);
}

C++: #include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <algorithm>
#include <stack>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;


int main(){
	vector<int> input(5);
	while(cin >> input[0] >> input[1] >> input[2] >> input[3] >> input[4]){
		for(int i = 0; i < 5; i++){
			for(int j = i + 1; j < 5; j++){
				if(input[i] < input[j]){
					swap(input[i],input[j]);
				}
			}
		}

		for(int i = 0; i < input.size(); i++){
			if(i){
				cout << " ";
			}
			cout << input[i];
		}
		cout << endl;
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int a[5];

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

	sort(a, a+3);

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

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

using namespace std;

int num[5];

int main()
{
	
	while(!cin.eof())
	{
		for( int i=0;i<5;i++)
		{
			cin >> num[i];
		}

		sort(num, num+5, greater<int>());

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

	}

	return 0;
}

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

using namespace std;

int main()
{
	set<int, greater<int> > n;
	set<int>::iterator ite;
	int a;

	for(int i=0; i<5; i++){
		cin >> a;
		n.insert(a);
	}
	for(ite=n.begin(); ite!=n.end(); ite++){
		cout << *ite << " ";
	}
	cout << endl;

	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>

#define ll long long int

using namespace std;
typedef pair<int, int> P;

priority_queue<int> pque;

string str;

int main()
{
  int a;
  int i;

  for(i=0;i<5;i++){
    cin>>a;
    pque.push(a);
  }
  for(i=0;i<5;i++){
    cout<<pque.top();;
    pque.pop();
    if(i<4)cout<<" ";
    else cout<<endl;
  }
}

C++: // 2011/06/17 Tazoe

#include <iostream>
using namespace std;

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

	for(int i=0; i<4; i++)
		for(int j=i+1; j<5; j++)
			if(num[i]<num[j]){
				int tmp = num[i];
				num[i] = num[j];
				num[j] = tmp;
			}

	for(int i=0; i<5; i++){
		cout << num[i];
		if(i<4)
			cout << ' ';
		else
			cout << endl;
	}

	return 0;
}

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

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define llong long long

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

C++: #include<stdio.h>

int main(void)
{
	int a,b,c,d,e,x[5],t=0;
	scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);

	for(t;t<5;t++)
	if(a>=b&&a>=c&&a>=d&&a>=e)
	{
		x[t]=a;
		a=0;
	}
	else if(b>=c&&b>=d&&b>=e)
	{
		x[t]=b;
		b=0;
	}
	else if(c>=d&&c>=e)
	{
		x[t]=c;
		c=0;
	}
	else if(d>=e)
	{
		x[t]=d;
		d=0;
	}
	else
	{
		x[t]=e;
		e=0;
	}

	printf("%d %d %d %d %d",x[0],x[1],x[2],x[3],x[4]);
	return 0;
}

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

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

C++: #include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#define pi 3.14159
using namespace std;


int main() {
	int a[5], temp;
	for (int i = 0; i < 5; i++) cin >> a[i];
	for (int i = 0; i < 4; i++) {
		for(int j = i + 1; j < 5; j++) {
			if(a[i] < a[j]) {
				temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			}
		}
	}
	for (int i = 0; i < 5; i++) {
		if(i == 4) cout << a[i] <<endl;
		else cout << a[i] << ' ';
	}
	

	return 0;
}