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<stdlib.h>
using namespace std;
int compare(const void *a,const void *b){
	return *(int*)b-*(int*)a;
}

int main(){
	int data[5];
	for(int i=0;i<5;i++)cin>>data[i];
	
	qsort(data,5,sizeof(int),compare);
	
	for(int i=0;i<5;i++)cout<<data[i]<<" ";
	cout<<endl;
}

C++: #include <stdio.h>
#include <algorithm>
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);
	reverse(a,a + 5);
	printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
	return 0;
}

C++: #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;

#define ISEQ(c) (c).begin(), (c).end()
typedef long long ll;

int main() {
  vector<int> a(5);
  for (int i = 0; i < 5; i++) {
    scanf("%d", &a[i]);
  }
  sort(a.rbegin(), a.rend());
  for (int i = 0; i < 4; i++) {
    printf("%d ", a[i]);
  }
  printf("%d\n", a[4]);
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define ALL(a) (a).begin(),(a).end()
#define all(a) (a).begin(),(a).end()

int main(void) {
  int n[5];

  cin >> n[0] >> n[1] >> n[2] >> n[3] >> n[4];

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

  cout<<n[0]<<" "<<n[1]<<" "<<n[2]<<" "<<n[3]<<" "<<n[4]<<" "<<endl;
  return 0;
}

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

using namespace std;

int main() {
	vector<int> num;
	int n;
	for(int i=0; i<5; i++)cin>>n,num.push_back(n);
	sort(num.rbegin(), num.rend());
	for(int i=0; i<4; i++){
		cout<<num[i]<<" ";
	}

	cout<<num[4]<<endl;

	return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define present(c, e) ((c).find((e)) != (c).end())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


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

C++: #include<iostream>

using namespace std;

#define size 5

main(){

  int data[5];


  cin >> data[0] >> data[1] >> data[2] >> data[3] >> data[4] ;

  for(int front = 0;front <size-1;front++){
    int minIndex = front;
    for(int j = front+1;j<size;j++){
      if(data[j]<data[minIndex])minIndex=j;
    }
    
    int temp = data[front];
    data[front]=data[minIndex];
    data[minIndex]=temp;
  }

  for(int i=size-1;i>=0;i--){
    cout << data[i]<<" ";
  }
  cout << endl;
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;

#define F first
#define S second
#define pb(x) push_back(x)
#define mp(a,b) make_pair(a,b)
#define sz size()
#define all(A)    A.begin(), A.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define f0(i,b)   for(int i=0;i<(b);i++)
#define f1(i,b)   for(int i=1;i<=(b);i++)
#define f2(i,a,b) for(int i=(a);i<=(b);i++)
#define fr(i,b,a) for(int i=(b);i>=(a);i--)
#define rep(i,a,b,c) for(int i=(a);i!=(b);i+=(c))
#define mod 1000000007

#define forr(i,n)    for(i=0; i<n; i++)
#define whilee(i,t)  while(i!=t)
#define  sl(a)  scanf("%lld",&a)
#define  pl(a)  printf("%lld",a)

//for(auto it =A.begin(); it!=A.end(); it++)
//sort(A.begin(),A.end());
//binary_search(A.begin(),A.end(),x);
//reverse(A.begin(), A.end());
//cout << *max_element(A.begin(), A.end());
//cout << *min_element(A.begin(), A.end());
//count(A.begin(), A.end(), X); //counts the occurrences of X
//distance(A.begin(),A.end());  //distance between first to last element
//accumulate(A.begin(), A.end(), 0); //add
//next_permutation(A.begin(), A.end());
//prev_permutation(A.begin(), A.end());
//swap(S[0], T[0]);
//scanf("%d",&x);
//printf("%d\n",x);

vector <int> A;
//deque <int> A;
//queue <int> A;
//stack <int> A;
//set <int> A;
//map <int,int> A;
//pair <int,int> A ;
//vector <pair <int,int>> A ;
//char ch;
//string S, T, U;
ll i, j, k, a, b, c, d, f, g, h, l, m, n, p, q, r, s, t, w, x, y, z, maxx=INT_MIN, minn=INT_MAX, ans=0, sum=0, cnt=0;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //cout.tie(nullptr);

    forr(i,5)
    {
        cin>>x;
        A.pb(x);
    }
    sort(all(A),greater<>());
    forr(i,5)
    {
        cout<<A[i]<<" ";
    }
    cout<<endl;
    return 0;
}

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

using namespace std;

int main(){
    vector<int> m(5);

    for(int i=0; i<5; i++){
        cin >> m[i];
    }
    sort(m.begin(), m.end(), greater<int>());

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

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

int main(){

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

  sort(v, v+5, greater<int>());
  
  for(int i=0; i<5; i++){
  	cout << v[i];
  	if(i != 4)
  		cout << " ";
	}
	cout << endl;
	
  return 0;
}

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

C++: #include <iostream>

int main(){
	
	int a[5];
	int s[5];
	for(int r=0;r<5;r++){
		s[r]=0;
	}
	for(int b=0;b<5;b++){
		std::cin>>a[b];
		if(a[b]>s[0]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=s[0];
			s[0]=a[b];
		}else if(a[b]>s[1]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=a[b];
		}else if(a[b]>s[2]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=a[b];
		}else if(a[b]>s[3]){
			s[4]=s[3];
			s[3]=a[b];
		}else{
			s[4]=a[b];
		}
	}
	for(int q=0;q<5;q++){
		std::cout<<s[q]<<" ";
	}
	return 0;
}

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

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];
	return 0;
}