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
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <math.h>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(long i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

const long double EPS = 1e-12;
const double INF = 1e12;


int main(){
	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 <bits/stdc++.h>

using namespace std;

int main(){
  vector<int> v(5);
  for(int i = 0 ; i < 5 ; i++){
    cin >> v[i];
  }
  sort(v.rbegin(),v.rend());
  bool flg = false;
  for(auto x : v){
    if(flg){ cout << " "; }
    flg = true;
    cout << x;
  }
  cout << endl;
  return 0;
}

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

int main(){

  int i;
  int a[5]={0};

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

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

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

  return 0;
}

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]<<" ";
    
        if(i==0){
            cout<<endl;
        }
    }
}

C++: #include<iostream>

using namespace std;

#define size 5

main(){

  int data[5];


  cin >> data[0] >> data[1] >> data[2] >> data[3] >> data[4] ;

  for(int front = 0;front <size-1;front++){
    int minIndex = front;
    for(int j = front+1;j<size;j++){
      if(data[j]<data[minIndex])minIndex=j;
    }
    
    int temp = data[front];
    data[front]=data[minIndex];
    data[minIndex]=temp;
  }

  cout << data[4]<<" "<< data[3]<<" "<< data[2]<<" "<< data[1]<<" "<< data[0]<<endl;
  return 0;
}

C++: #include<bits/stdc++.h>;
using namespace std;
int main(){
int a[5];
for( int s = 0; s < 5; s++){
 cin >> a[s];
}
sort( a, a + 5, greater<int>());
for(int i = 0; i < 5; i++){
if( i < 4 ){
cout << a[i] << " ";
}else{
cout << a[i] << endl;
}
}
return 0;
}

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

int main()
{
	std::vector<int> v(5);

	for(int i=0;i<5;++i)
	{
		std::cin >> v[i];
	}

	std::sort(v.begin(),v.end());

	for(int i=4;i>0;--i)
	{
		std::cout << v[i] << ' ';
	}

	std::cout << v[0] << '\n';
}

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

using namespace std;

int main()
{
    int input[5];

    for (int i = 0; i < 5; i++)
        cin >> input[i];

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

    for (int i = 0; i < 5; i++)
        cout << input[i] << " ";
    cout << '\b' << endl;

    return 0;
}

C++: #include <cstdio>
#include <algorithm>
int main(){
    int a[5];
    for(int i=0; i<5; i++)
        scanf("%d", &a[i]);
    std::sort(a, a+5);
    for(int i=4; i>0; i--)
        printf("%d ", a[i]);
    printf("%d\n", a[0]);
    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, greater<int>());
    for(int i=0;i<5;++i){
        cout << a[i];
        if(i == 4)cout << endl;
        else cout << ' ';
    }

    return 0;
}

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

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

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

int main(){
   int a,b,c,d,e,t;
   cin >> a >> b >> c >> d >> e;

   for(int i=0; i<5; i++){
	   if(b > a){
		t = a;
		a = b;
		b = t;
	   }else if(c > b){
		t = b;
		b = c;
		c = t;
	   }else if(d > c){
		t = c;
		c = d;
		d = t;
	   }else if(e > d){
		t = c;
		c = d;
		d = t;
	   }
   }

   cout << a << " " << b << " " << c << " " << d << " " << e << endl;

   return 0;
}

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

using namespace std;

int main()
{
    int input[5];

    for (int i = 0; i < 5; i++)
        cin >> input[i];

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

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


    return 0;
}

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]<<" ";
	//puts("");
	
	return 0;
}

C++: <?php
// Here your code !
$inputs = trim(fgets(STDIN));
$values = explode(' ', $inputs);
rsort($values);

foreach ($values as $value) {
  echo $value . ' ';
}
?>