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>

int main()
{
    std::vector<int> Numbers;
    for(std::size_t i = 0; i < 5; ++i){
        int n;
        std::cin >> n;
        Numbers.push_back(n);
    }
    std::sort(Numbers.begin(), Numbers.end(), std::greater<int>());
    for(std::size_t i = 0; i < Numbers.size(); ++i){
        if(i) std::cout << " ";
        std::cout << Numbers[i];
    }
    std::cout << std::endl;
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
long long int a[5];
int main()
{
	int i;
	for (i = 0; i < 5; i++)
	{
		scanf("%lld ", &a[i]);
	}
	sort(a, a + 5);
	for (i = 4; i>=0; i--)
	{ if (i!=0)
		printf("%lld ", a[i]);
	else
	{
		printf("%lld\n", a[i]);

	}
	}
	return 0;

}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define ub upper_bound
#define lb lower_bound
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;

signed main(){
  vector<int>v(5);
  rep(i,5)cin>>v[i];
  sort(v.begin(),v.end(),greater<int>());
  rep(i,5){
    cout<<v[i];
    if(i<4)cout<<' ';
  }
  cout<<endl;
  return 0;
}

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

using namespace std;

int comp(int a,int b){
    int buffer;
    if(a > b){
        b = buffer;
        b = a;
        a = buffer;
        return 1;
    }
    else{
        return 0;
    }
}

int main(){
    int k[5];
    cin >> k[0] >> k[1] >> k[2] >> k[3] >> k[4];
    while(comp(k[0],k[1]) || comp(k[1],k[2]) || comp(k[2],k[3]) || comp(k[3],k[4])){
    }
    cout << k[4] << " " << k[3] << " " << k[2] << " " << k[1] << " " << k[0] << endl;
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include <functional>
using namespace std;
int main(){
	int d[6]={};
	for(int i=0;i<5;i++){
		cin>>d[i];
	}
	sort(d,d+5,greater<int>());
	for(int i=0;i<5;i++){
		cout<<d[i]<<" ";
	}
	cout<<endl;
	
	
	return 0;
}

C++: /*AOJ 0018*/

#include<iostream>
using namespace std;

#define N 5

void Swap(int *a,int *b){
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

void BabbleSort(int *a){
	for(int i=0;i<N;i++){
		for(int j=N-1;j>i;j--){
			if(a[j] >= a[j-1]){
				Swap(&a[j],&a[j-1]);
			}
		}
	}
}


int main(){

	int a[N];

	while(cin>>a[0]){
		for(int i=1;i<N;i++){
			cin>>a[i];
		}

		BabbleSort(a);

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

C++: #include<stdio.h> 

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

		for(i=0;i<4;i++){
			for(j=i+1;j<5;j++){
				if(data[i]<data[j]){
					temp=data[i];
					data[i]=data[j];
					data[j]=temp;
				}
			}
		}
		
		for(i=0;i<4;i++){
			printf("%d　",data[i]);
		}

		printf("%d\n",data[5-1]);

		return 0;
}

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

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

C++: #include<bits/stdc++.h>
#include<vector>
using namespace std;
#define rep(i,n)for(int i=0;i<n;i++)

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int a,b,c,d,e;
  while(cin >> a >> b >> c>> d>> e){
    vector<int> v;
    v.push_back(a);
    v.push_back(b);
    v.push_back(c);
    v.push_back(d);
    v.push_back(e);
    sort(v.begin(), v.end(), greater<int>());
    cout << v[0] <<" "<<v[1]<<" "<<v[2]<<" "<<v[3]<<" "<<v[4]<<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<25; 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 = d;
		d = e;
		e = t;
	   }
   }

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

   return 0;
}

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

int main(int argc, const char * argv[])
{
    int n[5];
    for (int i = 0; i < 5; i++) {
        scanf("%d", &n[i]);
    }
    sort(&n[0], &n[5]);
    reverse(&n[0], &n[5]);
    
    for (int i = 0; i < 5; i++) {
        printf("%d", n[i]);
        if (i != 4) {
            printf(" ");
        }
    }
    puts("");
    
    return 0;
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>

using namespace std;

int main(void)
{
  int a[5];

  cin<<a[0]<<a[1]<<a[2]<<a[3]<<a[4];

  sort(a,a+5);

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

}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;

/*---------------------------------------------------*/

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

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

int main(){
	std::array<int, 5> num;
	
	while(std::cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4]){
		sort(num.begin(), num.end(), std::greater<int>());
		std::cout << num[0] <<" "<< num[1] << " " << num[2] <<" "<< num[3] << " " << num[4] << std::endl;
		}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>

typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;

int main(){
	int n = 5;

	vector<int> aa;

	REP(i, n){
		int a;
		cin >> a;
		aa.push_back(a);
	}

	sort(aa.begin(), aa.end(),greater<int>());

	int i(0);
	for (auto x : aa){
		cout << x;
		if (i != 4){
			cout << " ";
		}
		++i;
	}
	cout << endl;

	return 0;
}

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

int main(){
	int ans[6],i;
	for(i = 0;i < 5;i++){
		cin>>ans[i];
	}
	sort(ans,ans+5);

	while(i--){
		if(i == 4)
		cout<<ans[i];
		else
		cout<<" "<<ans[i];
	}
	cout<<endl;

	return 0;
}

C++: #include<iostream>
#include<algorithm>
int main(){
	int a[5];
	for(int i=0;i<5;++i){
		std::cin>>a[i];
	}
	std::sort(a,a+5,greater<int>());
	for(int i=0;i<5;++i){
		std::cout<<a[i]<<' ';
	}
	return 0;
}