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>
#include<algorithm>
using namespace std;

int main(){
    int n,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<<endl;
}

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

using namespace std;

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

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

int a[5];

int main()
{
  rep(i, 5) cin >> a[i];

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

  rep(i, 5) cout << a[i] << " "; cout << endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, c, d, e, x[5], i, j, y;
	cin >> a >> b >> c >> d >> e;
	x[0] = a;
	x[1] = b;
	x[2] = c;
	x[3] = d;
	x[4] = e;
	for ( j = 0;j < 5; j++)
	{	for ( i = 0;i < 4; i++)
		{
			if (x[i] < x[i + 1])
				{
					y = x[i + 1];
					x[i + 1] = x[i];
					x[i] = y;
				}
		}
	}
	cout << x[0] << " " <<x[1] << " " << x[2] << " " << x[3] << " " << x[4] << endl;
return 0;
}

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

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

C++: #include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
    vector<int> a(5);
    for (int i = 0; i < 5; ++i) cin >> a[i];
    sort(a.rbegin(), a.rend());
    for (int i = 0; i < 4; ++i) cout << a[i] << ' '; cout << a[4] << endl;
    return 0;
}

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

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

using namespace std;

int main(int argc, char **argv)
{
	int a[5];
	
	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
	
	sort(a, a+5);
	
	for(int i = 4; i >= 0; i--){
		cout << a[i] << " ";
	}
	
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
int main(){
	std::vector<int> a(5);
	for(int i=0;i<5;i++)std::cin>>a[i];
	sort(a.begin(),a.end(),std::greater<int>());
	for(int i=0;i<4;i++)std::cout<<a[i]<<" ";
	std::cout<<a[4]<<std::endl;
	return 0;
}

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

using namespace std;

int main(){

	vector<int> v;

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

	sort(v.rbegin(),v.rend());

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

	return 0;
}

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

#define FOR(var, start, end)    for(var = start; var < end; ++var)
#define WHILE(var, end)  while(var != end)
#define SHOW_ALL(a, b, c)    cout << a << endl; \
                                cout << b << endl; \
                                cout << c << endl;

using namespace std;


void BubbleSort(vector <int> &num)
{
      int i, j, flag = 1;    // set flag to 1 to start first pass
      int temp;             // holding variable
      int numLength = num.size( ); 
      for(i = 1; (i <= numLength) && flag; i++)
     {
          flag = 0;
          for (j=0; j < (numLength -1); j++)
         {
               if (num[j+1] > num[j])      // ascending order simply changes to <
              { 
                    temp = num[j];             // swap elements
                    num[j] = num[j+1];
                    num[j+1] = temp;
                    flag = 1;               // indicates that a swap occurred.
               }
          }
     }
     return;   //arrays are passed to functions by address; nothing is returned
}

int main()
{
    int input;
    vector<int> input_array;
    while(cin >> input){
        input_array.push_back(input);
    }
    BubbleSort(input_array);
    for(auto num:input_array){
        cout << num << " ";
    }
    
}

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

using namespace std;

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

C++: #include <iostream>

int main() {
	const int size = 5;
	int arr[size];
	std::cin
		>> arr[0]
		>> arr[1]
		>> arr[2]
		>> arr[3]
		>> arr[4];

	// sort
	for (int i = 0; i < size; i++)
		for (int j = i + 1; j < size; j++)
			if (arr[i] < arr[j]) {
				std::swap(arr[i], arr[j]);
				continue;
			}
			

	// show
	for (int i = 0; i < size; i++)
		std::cout << arr[i] << " ";

	std::cout << std::endl;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

// #define int ll
#ifdef _MSC_VER
const bool test = true;
#else 
const bool test = false;
#endif

int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
const int MAX = (int)2e5 + 5;

int main() {
	int a;
	vector<int> v;
	rep(i, 5) {
		cin >> a;
		v.push_back(a);
	}
	sort(ALL(v), greater<int>());
	cout << v.front();
	REP(i, 1, v.size()) {
		cout << " " << v[i];
	}
	cout << endl;
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <cstring>
#include <functional>

using namespace std;

#define REP(i,a,b) for((i)=(a);(i)<(int)(b);(i)++)
#define rep(i,n) REP(i,0,n)
// BEGIN CUT HERE
#define foreach(itr,c) for(typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
// END CUT HERE

int main(){
  int i;
  vector<int> in(5);

  rep(i,5) cin >> in[i];
  sort(in.begin(), in.end(), greater<int>());
  rep(i,4) cout << in[i] << " ";
  cout << in[4] << endl;

  return 0;
}