Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

C++: #include<iostream>

using namespace std;

void fsort(int a[])
{
    for(int i = 0; i < 5; ++i)
        for(int j = 0; j <= i; ++j)
            if(a[i] > a[j])
            {
                int tmp;
                tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }

    for(int i = 0; i < 4; ++i)
        cout << a[i] << " ";

    cout << a[4] << endl;
}

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

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

int main(){

int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int r = 0;
if(a < b){
r = a;
a = b;
b = r;
}
if(a < c){
r = a;
a = c;
c = r;
}
if(a < d){
r = a;
a = d;
d = r;
}
if(a < e){
r = a;
a = e;
e = r;
}

if(b < c){
r = b;
b = c;
c = r;
}
if(b < d){
r = b;
b = d;
d = r;
}
if(b < e){
r = b;
b = e;
e = r;
}
if(c < d){
r = c;
c = d;
d = r;
}
if(c < e){
r = c;
c = e;
e = r;
}
if(d < e){
r = d;
d = e;
e = r;
} 
cout << a << " "<< b <<" "<< c << " " << d << " " << e << endl;
    return 0;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int A[5] = {};
	cin >> A[0] >> A[1] >> A[2] >> A[3] >> A[4];
	for (int i = 1; i < 5; ++i){
		for (int j = i; j >= 1; --j){
			if (A[j] < A[j - 1]) swap(A[j], A[j - 1]);
			else break;
		}
	}
	cout << A[0] << " " << A[1] << " " << A[2] << " " << A[3] << " " << A[4] << "\n";
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
int main(){

	vector<int> ans(5);
	rep(i, 5) cin >> ans[i];
	SORT(ans);
	rep(i, 5){
		cout << ans[4-i];
		if(i != 4) cout << " ";
	}
	cout << endl;
	
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main()
{
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] << " ";
cout << "\n";
return 0;
}

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

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

int main(int argc, char *argv[]) {
	int array[5];
	
	fscanf(stdin, "%d %d %d %d %d", &array[0], &array[1], &array[2], &array[3], &array[4]);
	sort(array, array+sizeof(array)/sizeof(int), big_order);
	for (int i = 0; i < 5; i++) {
		printf("%d ", array[i]);
	}
	fflush(stdout);
	return 0;
}

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

using namespace std;

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

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

using namespace std;

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

C++: #include <bits/stdc++.h>
using namespace std;

int main() {
	ios :: sync_with_stdio(false);
	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 ++)
		cout << a[i] << (i + 1 == 5 ? '\n' : ' ');
	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]);
	
	return 0;
}

C++: #include<iostream>
#include<set>
#include<string>

int main() {
	int a, b, c, d, e;
	while (std::cin >> a >> b >> c >> d >> e) {
		std::set<int> sort;
		sort.insert(a); sort.insert(b); sort.insert(c); sort.insert(d); sort.insert(e);
		int i = 0;
		for (std::set<int>::reverse_iterator itr = sort.rbegin(); itr != sort.rend(); itr++) {
			std::cout << *itr;
			if (i < 4) std::cout << " ";
		}
		std::cout << std::endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	vector<int>in(5);
	rep(i,5)cin>>in[i];
	sort(all(in));
	rep(i,5){
		if(i)cout<<" ";
		cout<<in[4-i];
	}
}

C++: #include <bits/stdc++.h>
using namespace std;

#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)

#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.first)
#define cdr(a) (a.second)
#define cadr(a) (car(cdr(a)))
#define cddr(a) (cdr(cdr(a)))
#define all(a) a.begin(), a.end()
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;

typedef long long Integer;
typedef double Real;
typedef vector<int> vi;
typedef vector<string> vs;
typedef map<string,int> Dictionary;
const Real PI = acos(-1);

template<class S, class T>
ostream& operator<<(ostream& os, pair<S,T> p) {
  os << '(' << car(p) << ", " << cdr(p) << ')';
  return os;
}

template<class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = {  0, -1, 0, 1 };

string rot(string s) {
  string r = "";
  rep (i, s.size()) {
    char c = s[i] < 'a' ? s[i]
           : s[i] == 'z' ? 'a' : char(s[i]+1);
    r += c;
  }
  return r;
}

bool ok(string s) {
  int a = s.find("the");
  int b = s.find("this");
  int c = s.find("that");
  return a != string::npos || b != string::npos || c != string::npos;
}

int main() {

  vi xs;
  int x;
  while (cin >> x, cin) xs.push_back(x);
  sort(all(xs)); reverse(all(xs));
  cout << xs << endl;

  return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int a[5];

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


	return 0;
}

C++: #include<stdio.h>
#include<stdlib.h>
int main(){
    int i,j,k,x=0,l,n=5,a[100]={0};
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(j=0;j<=10000;j++){
        for(k=0;k<n;k++){
            if(a[k]<a[k+1]){
                x=a[k];
                a[k]=a[k+1];
                a[k+1]=x;
            }
        }
    }
    printf("\n");
    for(l=0;l<n;l++)printf("%d ",a[l]);
    printf("\n");
    return 0;
}

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

using namespace std;

int main(void){
  int x;
  vector<int> v;

  for(int i=0; i<5; i++){
    cin >> x;
    v.push_back(x);
  }

  sort(v.begin(), v.end(), greater<int>());

  for(int i=0; i<4; i++){
    cout << v[i] << " ";
  }
  cout << v[4] << endl;

  return 0;
}