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 <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;

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

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

    for (int i = 0; i < 5; i++)
        cout << input[i] << " ";
    cout << '\b\n';
//    cout << input[0] << " " << input[1] << " " << input[2] << " " << input[3];
//    cout << " " << input[4] << endl;


    return 0;
}

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

int main()
{
	int n[5];
	int x=0;

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

	}
	for(int i=0 ;i<5 ;i++){
		for(int j=i+1 ;j<5 ;j++){
			if(n[i] < n[j]){
				x = n[i];
				n[i] = n[j];
				n[j] = x;
			}
		}
	}

	for(int i=0 ;i<5 ;i++){
		cout << n[i] ;
		if(i < 4)
			cout << ' ' ;
		else if(i == 4)
			cout << endl;
	}

	return 0;
}

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

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

C++: #include<stdio.h>

int main(void){
	int data[5],work;
	int i,j;

	scanf("%d %d %d %d %d",&data[0],&data[1],&data[2],&data[3],&data[4]);

	for(i=0;i<=3;i++){
		for(j=i+1;j<=4;j++){
			if(data[i]<data[j]){
				work=data[i];
				data[i]=data[j];
				data[j]=work;
			}
		}
	}
	printf("%d %d %d %d %d",data[0],data[1],data[2],data[3],data[4]);

	return 0;
}

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

using namespace std;

/*-------------------------------*/
#define FOR(i, a, b) for(int i = (a); i < (b); i++)  //a~(b - 1)?????§
#define print(i) cout << i << endl //?°??????????Python?????????
#define all(i) (i).begin(),(i).end() //??¨??????(sort??¨???)
#define mp make_pair //mp(OO, OO)??¨???:::pint??¨???

typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<long long> llv;
typedef vector<pint> vpint;
/*-------------------------------*/

int main(void)
{
  vi a;
  int b;
  FOR(i, 0, 5){
    cin >> b;
    a.push_back(b);
  }
  sort(all(a));
  reverse(all(a));
  FOR(i, 0, 5) cout << a[i] << " ";
  print("");

  return 0;
}

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

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

C++: #include<iostream>

int main(){
    int a[5],i,j,n;
    
    for(i=0;i<5;i++){
        std::cin>>a[i];
         }
    for(i=0;i<5;i++){
        for(j=i+1;j<5;j++){
            if(a[i]<a[j]){
            n=a[i];
            a[i]=a[j];
            a[j]=n;
            	     }
                 }
            }
            
    for(i=0;i<5;i++){
    std::cout<<a[i]<<" ";
    }
             
return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int n[5];
	int tmp;
	for(int i = 0; i<5; ++i) cin >> n[i];	
	for(int i = 0; i<5; ++i) {
		for(int j = i+1; j < 5; ++j) {
			if(n[i] < n[j]){
				tmp = n[i];
				n[i] = n[j];
				n[j] = tmp;
			}
		}
	}
	for(int i = 0; i<5; ++i){
		if(i == 4) { 
			cout << n[i] << endl;;
		}else {
			cout << n[i] << " ";
		}
	}
	return 0;
}

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

using namespace std;

int main()
{
	int num[5];
	
	for (int i = 0; i < 5; i++){
		cin >> num[i];
	}
	
	for (int i = 0; i < 5; i++){
		for (int j = 0; j < 5; j++){
			if (num[i] >= num[j]){
				swap(num[i], num[j]);
			}
		}
	}
	
	cout << num[0];
	for (int i = 1; i < 5; i++){
		cout << " " << num[i];
	}
	cout << endl;
	
	return (0);
}

C++: #include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

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

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

int main()
{
	int n[5];
	
	for(int i = 0; i < 5; i++){
		scanf("%d", &n[i]);
	}
	
	sort(n,n+5);
	reverse(n, n+5);
	
	for(int i = 0; i < 4; i++){
		printf("%d ", n[i]);
	}
	
	printf("%d\n", n[4]);
	
	return(0);
}