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

int main(){
	vector<int> a;
	int n;

	for(int i=0 ; i<5 ; i++){
		cin >> n;
		a.push_back(n);
	}
	sort( a.begin(), a.end(), greater<int>());
	for(int i=0 ; i<=4 ; i++){
		cout << a[i];
		(i==4)? cout << endl : cout << " ";

	}
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


int main(){
	li a[5];
	
	rep(i,5)cin>>a[i];
	sort(a,a+5);
	
	rep(i,5){
		cout<<a[4-i];
		if(i<4)cout<<" ";
	}
	puts("");
	
	return 0;
}

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

using namespace std;

int line[5];

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

C++: #include <iostream>
#include <array>
#include <algorithm>
#include <iterator>
#include <cstdint>

int main()
{
	std::array<std::int32_t, 5> numbers;
	for (std::int32_t& num : numbers) {
		std::cin >> num;
	}
	std::sort(numbers.begin(), numbers.end(),
			std::greater<std::int32_t>());
	std::copy(numbers.begin(), numbers.end() - 1,
			std::ostream_iterator<std::int32_t>(std::cout, " "));
	std::cout << numbers.back() << std::endl;
	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
  int num[5];
  scanf("%d %d %d %d %d",&num[0],&num[1],&num[2],&num[3],&num[4]);
  sort(num,num+5,greater<int>());
  printf("%d %d %d %d %d\n",num[0],num[1],num[2],num[3],num[4]);
}

C++: #include<stdio.h>
#include<string.h>
#include<string>
#include<algorithm>


int main()
{
    int a[10];
    for(int i=0;i<5;i++)
    {
        scanf("%d",&a[i]);
    }

    int temp;
    for(int i=0;i<5;i++)
    {
        for(int j=0;j<5;j++)
        {
            if(a[i]<a[j])
            {
                temp=a[j];
                a[j]=a[i];
                a[i]=temp;

            }
        }
    }

    for(int i=0;i<5;i++)
    {
        printf("%d ",a[i]);
    }
    printf("\n");


 return 0;
}

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

int main()
{
  int a[5];
  int temp;
  cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];

  for(int i=0; i<4; i++){
    for(int j=i+1; j<5; j++){
      if( a[i]<a[j] ){
      temp = a[i];
      a[i] = a[j];
      a[j] = temp;
      }
    }
  }
  cout << a[0] << " " << a[1] << " " << a[2] << " " << a[3] << " " << a[4] << endl;

  return 0;
}

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

using namespace std;

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int b,i;
  vector <int> v;
  for(i=0;i<5;i++) {
    cin >> b;
    v.push_back(b);
  }
  sort(v.begin(),v.end(),greater<int>());
  cout << v[0];
  for(i=1;i<5;i++) cout << " " << v[i];
  cout << endl;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;

int a[5]={0};
int b[4]={0};
int hit=0,blow=0;

int main()
{
    for(int i=0;i<5;i++)
    {
        scanf("%d",&a[i]);
    }

    sort(a,a+5);
    for(int i=4;i>=0;i--)
    {
        printf("%d ",a[i]);
    }
    printf("\n");
    return 0;
}

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

using namespace std;

int main(){

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

	return 0;
}

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

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

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

int main(){
	
	int i, j, input[5];
	
	for(i=0; i<5; i++) cin >> input[i];
	
	sort(input, input+5, greater<int>());
	
	cout << input[0];
	
	for(j=1; j<5; j++) cout << " " << input[j];
	
	cout << endl;

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#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, greater<int>());
	
	for(int i=0; i<5; ++i){
		printf("%d",a[i]);
		if(i<4) printf(" ");
	}
	printf("\n");
	
	return 0;
}

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

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

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