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 <vector>
#include <string.h>
#include <algorithm>

#if 0
#define DEBUG_0331
#endif

static int getNumbers(std::vector<int>& vec);
static int sortNumbers(std::vector<int>& vec);
static void pushNumbers(std::vector<int>& vec);

int main()
{
    std::vector<int> vector;

    getNumbers(vector);
    sortNumbers(vector);
    pushNumbers(vector);
#ifdef DEBUG_0331
    for (int i = 0; i < vector.size(); i++ ) {
        std::cout << vector.at(i) << std::endl;
    }
#endif
    return 0;
}

static int getNumbers(std::vector<int>& vec)
{
    std::string s1("");
    char ss1[30] = {0};
    char *p = NULL;

    if ( 0x00 == &vec ) {
        return 1;
    }

    std::getline(std::cin, s1);

    p = ss1;
    memset(ss1, '\0', sizeof(ss1));
    memcpy(ss1, s1.c_str(), sizeof(ss1));
    // split
    while (*p) {
        if (' ' != *p) {
            vec.push_back(*p - '0');
        }
        p++;
    }

    return 0;
}

static int sortNumbers(std::vector<int>& vec)
{
    if ( 0x00 == &vec ) {
        return 1;
    }

    // sort
    std::sort(vec.begin(), vec.end(), std::greater<int>());

    return 0;
}

static void pushNumbers(std::vector<int>& vec)
{
    if ( 0x00 == &vec ) {
        return;
    }

    for (unsigned int i = 0; i < vec.size(); i++) {
        std::cout << vec.at(i);
        if (vec.size() - 1 == i) {
            std::cout << '\n';
        } else {
            std::cout << ' ';
        }
    }
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main() {
  int a, b, c, d, e;
  vector<int> v;
  v.push_back(a);
  v.push_back(b);
  v.push_back(c);
  v.push_back(d);
  v.push_back(e);
  sort(v.begin(), v.end(), greater<int>);
  for (int i = 0; i < v.size(); ++i) {
    cout << v[i];
    if (i < v.size() - 1) {
      cout << " ";
    }
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;

#define REP(i,n) for(int i=0; i<n; i++)
#define RPA(i,s,e) for(int i=s; i<=e; i++)
#define RPD(i,s,e) for(int i=s; i>=e; i--)
#define PB(a) push_back(a)
#define MP(i,s) make_pair(i,s)
#define SZ(a) (int)(a).size()
#define ALL(a) (a).begin(), (a).end()
#define PRT(a) cout << (a) << endl
#define PRT2(a,b) cout << (a) << " " << (b) << endl
#define PRT3(a,b,c) cout << (a) << " " << (b) << " " << (c) << endl

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


void coding() {
	vector<int> v(5);
	for(int i=0; i<5; i++) {
		cin>>v[i];
	}
	sort(ALL(v));
	for(int i=0; i<5; i++) {
		printf("%d%c", v[i], i==4 ? '\n' : ' ');
	}
}

// #define _LOCAL_TEST

int main() {
#ifdef _LOCAL_TEST
	clock_t startTime = clock();
	freopen("a.in", "r", stdin);
#endif

	coding();

#ifdef _LOCAL_TEST
	clock_t elapsedTime = clock() - startTime;
	cout << endl;
	cout << (elapsedTime / 1000.0) << " sec elapsed." << endl;
	cout << "This is local test" << endl;
	cout << "Do not forget to comment out _LOCAL_TEST" << endl << endl;
#endif
}

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

using namespace std;

int comp(int i, int j)
{
	return i > j;
}

int main(void)
{
	vector <long long int> num;
	long long int x = 0;
	
	int i = 0;
	while (i < 5)
	{
		scanf("%lld", &x);
		num.push_back(x);
		i++;
	}

	sort(num.begin(), num.begin() + 5, comp);

	for (int i = 0; i < 5; i++)
		printf("%lld ", num[i]);

	printf("\n");

	return 0;
}

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

int main()
{
	int a[5];

	for(int i=0; i<5; i++)
	{
		scanf("%d",& a[i]);
	}

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

	for(int i=0; i<4; i++)
	{
		printf("%d",a[i]);
		printf(" ");
	}
	
	printf("%d\n",a[4]);

	return 0;
}

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

int main(){
	int i, num[5];

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

	sort(num, num+5);
	for(i = 4; i > 0; i--){
		cout << num[i] << " ";
	}
	cout << num[0] << endl;

	return 0;
}

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

int main() {
	vector<int> numbers(5);
	cin >> numbers[0] >> numbers[1] >> numbers[2] >> numbers[3] >> numbers[4];
	sort(numbers.rbegin(), numbers.rend());
	for (int i = 0; i != 5; ++i) {
		cout << numbers[i] << " ";
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>

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

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int main() {
	vector<int>v;
	for (int i = 0; i < 5; ++i) {
		int n;
		cin >> n;
		v.push_back(n);
	}
	sort(v.rbegin(), v.rend());
	for (int i = 0; i < v.size(); ++i) {
		cout << v[i];
		if (i != v.size() - 1) { cout << " "; }
	}
	cout << endl;
}

C++: #include <iostream>
#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>());

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


    return 0;
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
int a[5];
for(int i=0;i<5;i++){
scanf("%d",&a[i]);
}
sort(a,a+5);
printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]);
}

C++: #include<iostream>
using namespace std;
int main(){
  int a[10]={},b=0;
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=1;i<5;i++)
      if(a[i-1]<a[i]) swap(a[i-1],a[i]);

  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  cout<<endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b,c,d,e;
	cin>>a;
	cin>>b;
	if(a<b){
		int i=0;
		i=b;
		b=a;
		a=i;
	}
	cin>>c;
	if(a<c){
		int i=0;
		i=c;
		c=a;
		a=i;
	}
	if(b<c){
		int i=0;
		i=c;
		c=b;
		b=i;
	}
	cin>>d;
	if(a<d){
		int i=0;
		i=d;
		d=a;
		a=i;
	}
	if(b<d){
		int i=0;
		i=d;
		d=b;
		b=i;
	}
	if(c<d){
		int i=0;
		i=d;
		d=c;
		c=i;
	}
	cin>>e;
	if(a<e){
		int i=0;
		i=e;
		e=a;
		a=i;
	}
	if(b<e){
		int i=0;
		i=e;
		e=b;
		b=i;
	}
	if(c<e){
		int i=0;
		i=e;
		e=c;
		c=i;
	}
	if(d<e){
		int i=0;
		i=e;
		e=d;
		d=i;
	}
	cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e;
}