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 <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++: //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
	int a[5];
	REP(i, 5) cin >> a[i];
	sort(a, a+5, greater<int>());
	REP(i, 5) {
		cout << a[i];
		if(i != 4) cout << " ";
	}
	cout << endl;

	return 0;
}

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

using namespace std;

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

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

using namespace std;

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

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

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

  for(int i = 0 ; i < 4 ; i++ ){
    for(int j = i+1 ; j < 5 ; j++ ){
      if(a[i] < a[j])swap(a[i],a[j]);
    }
  }
  cout << a[0];
  for(int i = 1 ; i < 5 ; i++ )cout <<' '<< a[i];
  cout << endl;
}

C++: #include <iostream>

int main(){
	
	int a[5];
	int s[5];
	for(int r=0;r<5;r++){
		s[r]=-100000;
	}
	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];
		if(q!=4){
			std::cout<<" ";
		}
	}
	std::cout<<std::endl;
	return 0;
}

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

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

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

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

C++: #include <bits/stdc++.h>
#define r(i,n) for(int i;i<n;i++)
using namespace std;
int main(){
  int a[5];
  r(i,5)cin>>a[i];
  sort(a,a+5);
  for(int i=4;i>=0;i--){
    cout<<a[i];
    if(!i)break;
    cout<<' ';
  }
  cout<<endl;
}

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

int main() {
	int a[5];
	for(int i=0; i<5; i++){
		cin >> a[i];
	}
	for(int j=0; j<5; j++){
		int v = a[j];
		int k = j-1;
		while(a[k]<v && k>=0){
			a[k+1] = a[k];
			k--;
			a[k+1] = v;
		}
	}
	for(int l=0; l<5; l++){
		cout << a[l] << ' ';
	}
	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 <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>

#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(x=from;x<to;x++)

using namespace std;


int main(void){

vector< int > su(5);

	rep(i,5) cin >> su[i];
	sort(su.begin(), su.end(), greater<int>());
	rep(i,5) cout << su[i] << (i<4 ? " ":"\n");

	
	return 0;
}

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

C++: #include <iostream>

using namespace std;

void swap(int& x,int& y)
{
	int tmp = x; x = y; y = tmp;
}

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

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

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

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

int main()
{
	int ans[5];
	cin>>ans[0]>>ans[1]>>ans[2]>>ans[3]>>ans[4];
	for(int i=0;i<5;i++)
	{
		for(int j=4;j>i;j--)
		{
			if(ans[j]>ans[j-1])
			{
				int tmp=ans[j];
				ans[j]=ans[j-1];
				ans[j-1]=tmp;
			}
		}
	}
	for(int i=0;i<5;i++)
	{
		if(i!=0) cout<<" ";
		cout<<ans[i];
	}
	cout<<endl;
	return 0;
}

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

using namespace std;

int main(){
  vector<int> hoge;
  for(int i=0; i<5; i++){
    int n;
    scanf("%d",&n);
    hoge.push_back(n);
  }

  sort(hoge.begin(),hoge.end());

  for(int i=0; i<5; i++){
    printf("%d",hoge[4-i]);
    if(i!=4)
      putchar(' ');
  }

}

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


int a[5];

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

	return 0;
}