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 <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define PREP(it,array) for(vector<P>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)

#define MP       make_pair
#define PB       push_back
#define ALL(x)   (x).begin(),(x).end()

const int INF = 1<<29;
const double EPS = 1e-9;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

typedef long long LL;
typedef pair<int,int> P;



int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(7); 

  int a[5];
  REP(i,5){
    int t;
    cin>>t;
    a[i]=t;
  }
  
  sort(a,a+5, greater<int>());
  
  REP(i,5){
    if(i!=0) cout << " ";
    cout << a[i];
  }
  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 = 4; i >= 0; i--) {
		cout << a[i] << " \n"[i == 0];
	}
	return 0;
}

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

int main() {
    int num[5];
    for(int i=0; i<5; i++) {
        cin>>num[i];
    }
    sort(num,num+5);
    for(int s=4; s>=0; s--) {
        cout<<num[s]<<endl;
    }
    return 0;
}

C++: x = sorted(map(int, raw_input().split()), reverse=True)

for e in x:
    print e,
print

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

	return 0;
}

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

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

int a[5];

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

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

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);
	for(int i=4;i>=0;i--)cout<<a[i]<<' ';
}

C++: #include<cstdio>
#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);
	reverse(a,a+5);
		for(int i = 0;i < 5;i++)
		{
			printf("%d",a[i]);
			if(i <= 5) printf(" ");
		}



	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<stdlib.h>

int a[6],i;

int comp(const void *p,const void *q){
	return *(int *)q-*(int *)p;
}

int main(){
	scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
	qsort(a,5,sizeof(int),comp);
	for(i=0;i<5;i++){
		if(i!=4)printf("%d ",a[i]);
		else printf("%d\n",a[i]);
	}
	return 0;
}

C++: #include <iostream>
#include <cmath>
#include <algorithm>
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){
    cout << A[i];
    if(i != 5){
      cout << " ";
    }
  }
  cout << endl;
}

C++:  
  #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 
 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>=1;i--) cout<<arr[i]<<" ";
   cout<<arr[0]<<endl;
   //while(1);      
   return 0;    
 }

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

// #define int ll
#ifdef _MSC_VER
const bool test = true;
#else 
const bool test = false;
#endif

int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
const int MAX = (int)2e5 + 5;

int main() {
	int a;
	vector<int> v;
	rep(i, 5) {
		cin >> a;
		v.push_back(a);
	}
	sort(ALL(v), greater<int>());
	cout << v.front();
	REP(i, 1, v.size()) {
		cout << " " << v[i];
	}
	return 0;
}

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

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

C++: #include <algorithm>
#include <functional>
#include <iostream>
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++) {
        cout << a[i] ;
		if(i!=4){
			cout << " ";
		}
    }
	cout << endl;
	
    return 0;
}

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

using namespace std;

int main(void) {
	int in[5], n[5]={0,1,2,3,4}, tmp, i, j;

	cin >> in[0] >> in[1] >> in[2] >> in[3] >> in[4];
	for(i=0;i<5;i++) {
		for(j=i;j<5;j++) {
			if(in[n[j]] > in[n[i]]) {
				tmp = n[j];
				n[j] = n[i];
				n[i] = tmp;
			}
		}
	}
	printf("%d %d %d %d %d\n", in[n[0]] ,in[n[1]] ,in[n[2]] ,in[n[3]] ,in[n[4]]);
	return 0;
}

C++: #include <stdio.h>

static void
sort(int* h, int n)
{
	for (int i = 0; i < n; i++) {
		for (int j = n - 1; j > i; j--) {
			if (h[j] > h[j-1]) {
				int tmp = h[j];
				h[j] = h[j-1];
				h[j-1] = tmp;
			}
		}
	}
}

int
main(void)
{
	char line[80];
	int a[5];

	if (fgets(line, sizeof line, stdin)) {
		if (sscanf(line, "%d %d %d %d %d",
		    &(a[0]), &(a[1]), &(a[2]), &(a[3]), &(a[4])) == 5) {
			sort(a, 5);
			
			printf("%d %d %d %d %d\n", a[0], a[1], a[2], a[3], a[4]);
		}
	}

	return 0;
}

C++: #include<iostream>
#include<set>
#include<string>

int main() {
	int a, b, c, d, e;
	while (std::cin >> a >> b >> c >> d >> e) {
		std::set<int> sort;
		sort.insert(a); sort.insert(b); sort.insert(c); sort.insert(d); sort.insert(e);
		int i = 0;
		for (std::set<int>::reverse_iterator itr = sort.rbegin(); itr != sort.rend(); itr++) {
			std::cout << *itr;
			if (i < 4) std::cout << " ";
			i++;
		}
		std::cout << std::endl;
	}
	return 0;
}