Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	scanner.Split(bufio.ScanWords)
	nums := make([]int, 5)
	for i := 0; i < 5; i++ {
		nums[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(nums)))
	for i, v := range nums {
		if i == len(nums)-1 {
			fmt.Printf("%d\n", v)
		} else {
			fmt.Printf("%d ", v)
		}
	}
}

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;
}

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

using namespace std;

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

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

using namespace std;

int main()
{
	int a[5];

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

		for (int j = (i - 1); j >= 0; j--)
		{
			if (a[j] < a[j + 1])
			{
				swap(a[j], a[j + 1]);
			}
		}
	}

	cout << a[0] << ' ' << a[1] << ' ' << a[2] << ' ' << a[3] << ' ' << a[4] << endl;
	
	return 0;
}

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

int main(int argc, char *argv[]){
  using namespace std;
  vector<int> res;
  for (int i=0; i<5; ++i){
    int data;
    cin >> data;
    res.push_back(data);
  }
  sort(res.begin(), res.end(), greater<int>());
  vector<int>::iterator it = res.begin();
  while (it != res.end()){
    cout << *it;
    ++it;
    if (it != res.end()){
      cout << " ";
    }
    else{
      cout << endl;
    }
  }
  return 0;
}

C++: 
#include<stdio.h>

int Counting_sort(int A[], int k, int n)
{
    int i=0, j=0;
    int B[15], C[100];
    for(i = 0; i <= k; i++)
            C[i] = 0;
    for(j =1; j <= 5; j++)
            C[A[j]] = C[A[j]] + 1;
    for(i = 1; i <= k; i++)
            C[i] = C[i] + C[i-1];
    for(j = n; j >= 1; j--)
    {
            B[C[A[j]]] = A[j];
            C[A[j]] = C[A[j]] - 1;
    }

    for(i = 5; i >=1; i--)
    {
        if(i==1)
            printf("%d\n",B[i]);
        else
            printf("%d ",B[i]);
    }

}

int main()
{
    int n=0,i=0,k = 0, A[15]={0};
    while(1)
    {


    for ( i = 1; i <= 5; i++)
    {
         scanf("%d",&A[i]);
         if(A[i] > k)
         {
            k = A[i];
         }
    }
    Counting_sort(A, k, 5);
    }
     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 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<4; l++){
		cout << a[l] << ' ';
	}
	cout << a[4] << endl;
	return 0;
}

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

int main(){
	priority_queue<int> que;
	for(int i = 0;i < 5;i++){
		int a;
		cin >> a;
		que.push(a);
	}
	while(!que.empty()){
		if(que.size() > 1)
			cout << que.top() << " ";
		else
			cout << que.top();
		que.pop();
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	vector<int> v(5);
	REP(i, 0, 5) cin >> v[i];
	SORT(v);
	for (int i = 4; i > -1;i--) {
		if(i!=0)  cout << v[i] <<" ";
		else cout << v[i] << endl;
	}

	return 0;
}

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

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  vector<int> a(5);
  for (int i = 0; i < 5; i++) {
    cin >> a[i];
  }
  sort(a.rbegin(), a.rend());
  for (int i = 0; i < 5; i++) {
    cout << a[i] << " \n"[i + 1 == 5];
  }

  return 0;
}