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 <algorithm>
#include <sstream>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <string>
#include <queue>
#include <vector>
using namespace std;

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

int main()
{
	int a, b, c, d, e;
	vector<int> A;
	cin >> a >> b >> c >> d >> e;
	A.push_back(a);
	A.push_back(b);
	A.push_back(c);
	A.push_back(d);
	A.push_back(e);
	sort(A.begin(), A.end(), comp);

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

C++: #include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>
#include<array>

using namespace std;

int main()
{
  array<int,5> a;

  for ( auto i = 0; i < 5; ++i )
    cin >> a[i];

  sort( a.begin(), a.end(), []( int x, int y ){ return x > y; } );
  
  for ( auto i = 0; i < 5; ++i )
    {
      if ( i ) cout << " ";
      cout << a[i];
    }

  cout << endl;
  
  return 0;
}

C++: #include<stdio.h>

int main ()
{
    long long int a,b,c,d,e;
    scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e);
     long long int number[30];
    long long int i, j,temp;
    number[0]=a;
    number[1]=b;
    number[2]=c;
    number[3]=d;
    number[4]=e;

    for (i = 0; i < 5; ++i)
    {
        for (j = i + 1; j < 5; ++j)
        {
            if (number[i] < number[j])
            {
                temp= number[i];
                number[i] = number[j];
                number[j] = temp;
            }
        }
    }
    a=number[0];
    b=number[1];
    c=number[2];
    d=number[3];
    e=number[4];
     printf("%lld %lld %lld %lld %lld",a,b,c,d,e);

return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int a[5],j;
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
	
	for(int i=1;i<5;i++){
		if(a[0]<a[i]){
			j=a[0];
			a[0]=a[i];
			a[i]=j;
		}
	}
	for(int k=2;k<5;k++){
		if(a[1]<a[k]){
			j=a[1];
			a[1]=a[k];
			a[k]=j;
		}
	}
	for(int l=3;l<5;l++){
		if(a[2]<a[l]){
			j=a[2];
			a[2]=a[l];
			a[l]=j;
		}
	}
	if(a[3]<a[4]){
		j=a[3];
		a[3]=a[4];
		a[4]=j;
	}
	
	cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<endl;
		
	return 0;
}

C++: #include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<iomanip>
#include<string>
#include<algorithm>
using namespace std;

int gcd(long long int m,long long int n){
	while(m!=n){
		if(m>n){m=m-n;
		}
		else n=n-m;
	}
	return m;
}
int lmc(long long int m,long long int n){
return m*n/gcd(m,n);
}

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

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(void){
  int x;
  vector<int>vec;

  for(int i=0;i<5;i++){
    cin >> x;
    vec.push_back(x);
  }
  sort(vec.begin(),vec.end(),greater<int>());
  for(vector<int>::iterator ite=vec.begin();ite!=vec.end();ite++){
    cout << *ite;
    if(ite+1!=vec.end())cout <<" ";
    else cout << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
  int n=0;
  vector<int> v;
  for(int i=0;i<5;i++) {
    cin>>n;
    v.push_back(n);
  }
  sort(v.begin(),v.end());
  reverse(v.begin(),v.end());
  for(int i=0;i<5;i++){
    cout<<v[i];
if(i!=4)
cout<<" ";
}
  cout<<endl;

    
  return 0;
}

C++: #include<iostream>
int main(){
	int a[5],i,j,t;

	for(i=0;i<5;i++){	
	std::cin>>a[i];
	
	}
	for(i=0;i<4;i++){	
		for(j=i+1;j<5;j++){
			if(a[i]<a[j]){
				t=a[i];
				a[i]=a[j];
				a[j]=t;
		
			}
		}
	}	
		std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<std::endl;

return 0;
}

C++: ??? #include <iostream>
using namespace std;
int main(){
	int number[6] , i , j , ans[6] ;
	for( i=1 ; i<=5 ; i++ )
		cin >> number[i] ;
	for( i=1 ; i<=5 ; i++ ){
		for( j=i ; j<=5 ; j++ ){
			if( number[i] < number[j] )
				swap( number[i] , number[j] );
		}
		ans[i] = number[i];
		cout << ans[i] <<" ";
	}
}

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

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

int main(){
int num[5];
int M1 = 0, M2 = 0, M3= 0 , M4= 0 , M5 = 0;
int I1 = 0, I2 = 0, I3= 0 , I4= 0 , I5 = 0 ;
cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4] ;

for(int i=0 ; i < 5; i++){
if(M1 < nim[i]) {
M1 = num[i];
I1 = i;
}
}

for(int i=0 ; i < 5; i++){
if(i == I1 ) continue;
if(M2 < nim[i]) {
M2 = num[i];
I2 = i
}
}

for(int i=0 ; i < 5; i++){
if(i == I1 || i == I2 ) continue;
if(M3 < nim[i]) {
M3 = num[i];
I3 = i
}
}

for(int i=0 ; i < 5; i++){
if( i == I1 || i == I2 || i == I3 ) continue;
if(M4 < nim[i]) {
M4 = num[i];
I4 = i
}
}

for(int i=0 ; i < 5; i++){
if( i == I1 || i == I2 || i == i3 || i == I4 ) continue;
if(M5 < nim[i]) {
M5 = num[i];
I5 = i
}
}

cout << M1 << " " << M2 << " " << M3 << " " << M4 << " " << M5 << endl;

return 0 ;
}

C++: #include<iostream>
#include<algorithm>
#define REP(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
  int in[5];
  REP(i,5) cin >> in[i];
  sort(in, in + 5, greater<int>());
  REP(i,4) cout << in[i] << " ";
  cout << in[4] << "\n";
}

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

using namespace std;

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

C++: #include "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	auto V=vecin(5);
	sort(ALL(V),greater<int>());

	REP(i,4){
		cout << V[i] << ' ';
	}
	out(V[4]);
	return 0;
}