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<vector>
#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);
	for(int i=4;i>0;i--)printf("%d ",a[i]);
	printf("%d\n",a[0]);
}

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

using namespace std;

int v[5];

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

    sort(v, v + 5);
    reverse(v, v + 5);

    for(int i = 0; i < 5; i++) {
        cout << v[i] << " ";
    }
    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++: #include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<iostream>
#include<algorithm>
using namespace std;

int main ()
{
    int n,a[100],i;
    for(i=0;i<5;i++)
    {
        cin>>a[i];
    }
    sort(a,a+5);
    int f=0;
    for(i=4;i>=0;i--)
    {
        if(f==0)
        {cout<<a[i]; f=1;}
        else
            cout<<" "<<a[i];

    }
    cout<<endl;
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#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]);
		printf(" ");
	}

	printf("\n");

	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a[10]={},b=0;
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=1;i<5;i++)
      if(a[i-1]<a[i]) swap(a[i-1],a[i]);

  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  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);
	cout << a[4] << ' ';
	cout << a[3] << ' ';
	cout << a[2] << ' ';
	cout << a[1] << ' ';
	cout << a[0] << endl;
	return 0;
}

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

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<<(i?" ":"")<<a[i];
	cout<<endl;
	return 0;
}

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

int main(){
int a;
int b[5];
int c;
int d;
int e;
c=0;
while(c<5){
b[c]=0;
c=c+1;
}
c=0;
while(c<5){
cin >>a;
d=0;
while(1){if(a>=b[d]){e=d; if(e<4){while(e<4){b[e+1]=b[e]; e=e+1;}} b[d]=a; break;} d=d+1;     }
c=c+1;
}
c=0;
while(c<5){
cout << b[c] <<" ";
c=c+1;}



}

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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> lot(5);
  for(int i=0; i<5; i++) cin >>lot[i];
  sort(lot.begin(),lot.end());
  for(int i=0; i<5; i++){
    cout <<lot[i];
    if(i == 4) cout <<endl;
    else cout <<" ";
  }
  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, greater<int>());
	cout << a[0] << " " << a[1] << " " << a[2] << " " << a[3] << " " << a[4] << endl;
	return 0;
}

C++: #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
typedef vector <int> vi;

int main(void){
	int n=5;
	vi a(n);
	for (int i=0; i<n; i++){
		cin>>a[i];
	}
	sort(&a[0], &a[n], greater <int>());

	for (int i=0; i<n; i++){
		if (i==n-1) cout<<a[i]<<endl;
		else cout<<a[i]<<" ";
	}
	return 0;
}

C++: #include<stdio.h>

void swap(int *a,int *b){
	int temp;
	temp=*a; *a=*b; *b=temp;
}

int main(void){
	int a[5];
	int i,j;

	scanf("%d %d %d %d %d", &a[0],&a[1],&a[2],&a[3],&a[4]);
	
	j=4;
	while(j-->0){
		for(i=4; i>0;i--)
		if(a[i-1]<a[i]) swap(&a[i-1],&a[i]);
			};

	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 v[5];
  for(int i = 0; i < 5; i++) cin >> v[i];
  sort( v, v + 5 );
  reverse(v, v + 5);
  cout << v[0];
  for(int i = 1; i < 5; i++) cout << " " << v[i];
}

C++: //0018 Sorting Five Numbers
//®a,b,c,d,eªüÍ³ê½Æ«A~É®ñµÄoÍ·évOðì¬¹æ

//±ñÈsort()Ä×ÎIíéæ¤ÈâèAVÎÈ¢Æ¹¶áÈ¢

#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;

int main(void)
{
	const int N = 5;
	int a[N];
	int i;

	//µå¤ªÈ¢©çÉÊÉ
	for(i = 0; i < N; i++)
		cin >> a[i];
	sort(a, a+N, greater<int>());
	for(i = 0; i < N; i++)
		(i ? cout<<' '<<a[i] : cout<<a[i]);
	cout << endl;

	/*
	//±êAVC++¾ÆRpCÅ«éÌÉñoµ½çRpCG[HçÁ½
	//[JNXÍn¹È¢ñ¾Á¯
	struct X
	{
		int operator()(int) { int a;cin >> a;return a;}
	};
	struct Y
	{
		int n;
		Y():n(0){}
		void operator()(int a) { (n++?cout<<' '<<a:cout<<a);}
	};
	transform(a, a+N, a, X());
	sort(a, a+N, greater<int>());
	for_each(a, a+N, Y());
	cout << endl;
	*/

	/*
	//±ê¾ÆAüÍÉEOFªKvÅAoÍÉXy[Xª½­ÈÁÄµÜ¤
	copy(istream_iterator<int>(cin), istream_iterator<int>(), a);
	sort(a, a+N, greater<int>());
	copy(a, a+N, ostream_iterator<int>(cout, " "));
	*/
	return 0;
}

C++: ??? #include <iostream>
using namespace std;
int main(){
	int number[6] , i , j , ans[6] ;
	for( i=1 ; i<=5 ; i++ )
		cin >> number[i] ;
	for( i=1 ; i<=5 ; i++ ){
		for( j=i ; j<=5 ; j++ ){
			if( number[i] < number[j] )
				swap( number[i] , number[j] );
		}
		ans[i] = number[i];
		cout << ans[i] <<" ";
	}
}

C++: 
#include<stdio.h>

int Counting_sort(int A[], int k, int n)
{
    int i, j;
    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--)
          printf("%d  ",B[i]);
}

int main()
{
    int n,i,k = 0, A[15];
    for ( i = 1; i <= 5; i++)
    {
         scanf("%d",&A[i]);
         if(A[i] > k)
         {
            k = A[i];
         }
    }
    Counting_sort(A, k, 5);
     return 0;
}