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 <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>


using namespace std;

int main()
{
	int hoge[5];
	for (int i = 0; i < 5; ++i)
		scanf("%d", hoge+i);
	sort(hoge, hoge+5, greater<int>());
	for (int i = 0; i < 4; ++i)
		printf("%d ", hoge[i]);
	printf("%d\n", hoge[4]);

	return 0;
}

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

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

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

using namespace std;

int main(int argc, char const* argv[])
{
	int target[5];

	while( 1 ){
		cin >> target[0] >> target[1] >> target[2] >> target[3] >> target[4];

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

		for( int i = 0;i < 5;i++ ){
			cout << ( i == 0 ? "" : " " ) << target[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);
	}
	int i=0;
	for(ite=n.begin(); i<5; ite++, i++){
		if(i==4){ cout << *ite;}
		else{cout << *ite << " ";}
	}

	return 0;
}

C++: #include<iostream>
#include<sstream>
#include<fstream>
#include<cstdio>
#include<vector>
#include<list>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<string>
using namespace std;

bool order(int a,int b){
	return a>b;
}	

int main(){
	vector<int> w;
	for(int x=0;x<5;++x){
		int j;scanf("%d",&j);
		w.push_back(j);
	}
	sort(w.begin(),w.end(),order);
	for(int x=0;x<5;++x){
		cout<<w[x]<<" ";
	}
	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); reverse(a,a+5);
for(int i=0;i<5;i++){
if(i) cout<<" ";
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 <= 3) printf(" ");
		}
		printf("\n");



	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <math.h>
#include <string>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <cstring>
#include <sstream>
#include <stdlib.h>

using namespace std;

int main (void)
{
	int a[4];
	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];
		if (i != 0)
		{
			cout << " ";
		}
		else
		{
			cout << endl;
		}
	}
}

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

int main() {
	int a,b,c,d,e;
	cin>>a>>b>>c>>d>>e;
	int num[]={a,b,c,d,e};
	for(int i=0;i<5;i++)
		for(int j=i+1;j<5;j++)
			if(num[i]<num[j])
				swap(num[i],num[j]);
	for(int i=0;i<5;i++)
		cout<<num[i];
	cout<<endl;
}

C++: #include <stdio.h>

int main() {
    int n[5];
    scanf("%d %d %d %d %d", &n[0], &n[1],&n[2],&n[3],&n[4]);

    {
        bool finished = false;
        while (!finished) {
            finished = true;
            for (int i = 0; i < 4; ++i) {
                if (n[i] < n[i + 1]) {
                    int temp = n[i + 1];
                    n[i + 1] = n[i];
                    n[i] = temp;
                    finished = false;
                }
            }
    }
    }

    for (int i = 0; i < 5; ++i) {
        char c = (i == 4) ? '\n' : ' ';
        printf("%d%c", n[i], c);
    }
    return 0;
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


int main(){
	li a[5];
	
	rep(i,5)cin>>a[i];
	sort(a,a+5);
	
	rep(i,5)cout<<a[4-i]<<" ";
	puts("");
	
	return 0;
}

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

int main(){
	int a[5],i;
	while(cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4]){
		sort(a,a+5,greater<int>());
		i=0;
		for(int i=0;i<5;i++){
			cout << a[i];
			if(i!=4)cout << " ";
			else cout << endl;
		}
	}
}

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

using namespace std;

int main()
{
	int numbers[5];
	for(auto& n : numbers)
		cin >> n;

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

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

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

int main(){
    vector<int> v;
    int n;
    for (int i = 0; i < 5; i++){
	cin >> n;
	v.push_back(n);
    }
    sort(v.begin(), v.end(), greater<int>());

    for (int i = 0; i < 5; i++)
	printf("%d%c", v[i], (i == 4)? '\n':' ');

}

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()
{
	
		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 <stdio.h>
#include <algorithm>

using namespace std;

int greater(int a, int b){
  return a>b;
}

int main(){
  int a[5];
  scanf("%d%d%d%d%d", a, a+1, a+2, a+3, a+4);

  sort(a, a+5, greater);

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

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

using namespace std;

void solve()
{
	int a, b, c, d, e;
	cin >> a >> b >> c >> d >> e;
	priority_queue<int> PQue;
	PQue.push(a);
	PQue.push(b);
	PQue.push(c);
	PQue.push(d);
	PQue.push(e);
	for(int i = 0; i < 4; ++i)
	{
		cout << PQue.top() << " ";
		PQue.pop();
	}
	cout << PQue.top() << endl;
}

int main()
{
	solve();
	return(0);
}

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

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  vector<int> a(5);
  REP(i, 5) cin >> a[i];
  sort(ALL(a));
  RREP(i, 5) {
    if (i != 4) cout << " ";
    cout << a[i];
  }
  cout << "\n";
  return 0;
}