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 <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>


using namespace std;

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

	return 0;
}

C++: #include<iostream>
int main()
{
	int n[5];
	for (int i = 0; i < 5; i++)
	{
		std::cin >> n[i];
	}
	for (int i = 0; i < 5; i++)
	{
		int max = -100001, max_index = 0;
		for (int j = i; j < 5; j++)
		{
			if (max < n[j])
			{
				max = n[j];
				max_index = j;
			}
		}
		std::swap(n[i], n[max_index]);
	}
	for (int i = 0; i < 5; i++)
	{
		std::cout << n[i] << ' ';
	}
	std::cout << 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());

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

	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, greater<int>());
	cout << a[0];
	for(int i = 1; i<5; i++ ) cout << " " << a[i];
	cout << endl;
	return 0;
}

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

using namespace std;

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

int main()
{
    vector<int> vi;
    int a, b, c, d, e;
    
    cin >> a >> b >> c >> d >> e;
    vi.push_back(a);
    vi.push_back(b);
    vi.push_back(c);
    vi.push_back(d);
    vi.push_back(e);
    
    sort(vi.begin(), vi.end());
    reverse(vi.begin(), vi.end());
    
    for (int i = 0; i < vi.size(); i++){
        cout << vi[i] << " ";
    }
    cout << endl;
}

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

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

double dot(P a,P b){return real(conj(a)*b);};
double cross(P a,P b){return imag(conj(a)*b);};

int main(){
  vi a(5);
  REP(i,5)cin>>a[i];
  sort(a,a+5);
  reverse(a,a+5);
  cout<<a[0];
  REPR(i,5)cout<<" "<<a[i];
  cout<<endl;
  return 0;
}

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

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

C++: #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
  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];
    if(i<4){
      cout<<" ";
    }if(i==4){
      cout<<endl;
    }
  }
  return 0;
}

C++: 
#include <iostream>
#include<string>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
    int i,a[5];
    for(i=0;i<5;i++){
        cin>>a[i];
    }
    sort(a,a+5);
    for(i=4;i>=0;i--){
        if(i==0)cout<<a[i];
      else  cout<<a[i]<<" ";
    }
    cout<<endl;
     return 0;
}

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

using namespace std;

int main() {
    array<int, 5> a;
    
    for(int i = 0;i < 5;i++) {
        cin >> a[i];
    }
    
    sort(a.begin(), a.end(), greater<int>());
    
    for(int i = 0;i < 5;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]<<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);
	
	cout << a[4];
	for(int i = 3; i >= 0; i--){
		cout << " " << a[i];
	}
	cout << endl;
	
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n[5];
  for(int i=0; i<5; i++)
    cin >> n[i];
  sort(n, n+5);
  for(int i=4; i>0; i--)
    cout << n[i] << " ";
  cout << n[0] << endl;

  return 0;
}

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

int main()
{
	vector<int> Number(5);
	scanf("%d%d%d%d%d", &Number[0], &Number[1],&Number[2],&Number[3],&Number[4]);
	sort(Number.begin(), Number.end(), greater<int>());
	printf("%d %d %d %d %d\n", Number[0], Number[1], Number[2], Number[3], Number[4]);
	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 > -1;i--)
    {
      cout << a[i];
      if(i)cout << " ";
    }
  cout << endl;
  
  return 0;
}

C++: #include <iostream>

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

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

C++: #include<stdio.h>

int main(void)
{
	int a,b,c,d,e,x[5],t=0;
	scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);

	for(t;t<5;t++)
	if(a>=b&&a>=c&&a>=d&&a>=e)
	{
		x[t]=a;
		a=-1;
	}
	else if(b>=c&&b>=d&&b>=e)
	{
		x[t]=b;
		b=-1;
	}
	else if(c>=d&&c>=e)
	{
		x[t]=c;
		c=-1;
	}
	else if(d>=e)
	{
		x[t]=d;
		d=-1;
	}
	else
	{
		x[t]=e;
		e=-1;
	}

	printf("%d %d %d %d %d\n",x[0],x[1],x[2],x[3],x[4]);
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int a[5];
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
    sort(a,a+5);
    int b[5];
    for(int i=0;i<5;i++){
       b[4-i]=a[i];
    }
    cout<<b[0]<<" "<<b[1]<<" "<<b[2]<<" "<<b[3]<<" "<<b[4]<<endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
  vector<int> v;
  for( int i=0; i<5; i++ ){
    int d;
    cin >> d;
    v.push_back( d );
  }
  sort( v.begin(), v.end() );
  cout << v[4] << ' ' << v[3] << ' ' << v[2] << ' ' << v[1] << ' ' << v[0] << endl;
  return 0;
}