Go: package main

import (
        "fmt"
        "sort"
)


func main() {
        var s []int
        var n int
        for i := 0; i < 5; i++ {
                fmt.Scanf("%d", &n)
                s = append(s, n)
        }
        sort.Ints(s)
        for i:= 1; i <= len(s); i++ {
                fmt.Printf("%d", s[len(s)-i])
                if i < len(s) {
                        fmt.Printf(" ")
                }
        }
        fmt.Printf("\n")
}

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
	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 << " ";
	}

	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
  vector<int> a;
  int ptr=0;
  int tmp;
  while(cin>>tmp) a.push_back(tmp);
  stable_sort(a.begin(),a.end(),greater<int>());
  for(int i=0;i<a.size();++i) cout<<a[i]<<(i==a.size()-1?"":" ");
  cout<<endl;
  return 0;
}

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

int main(){
	int a[5];
	int tmp;
	for(int i=0; i<5 ; i++){
		cin >> a[i];
	}
	for(int j=0;j<4;j++){
		for(int k=j+1;k<5;k++){
			if(a[j]<a[k]){
				tmp = a[j];
				a[j] = a[k];
				a[k] = tmp;
			}
		}
	}

	for(int l =0; l<5 ; l++) cout << a[l] << " ";
}

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

int main()
{
	std::list<int> gets ;
	int get ;

	for( int i = 0 ; i < 5 ; i ++ )
	{
		std::cin >> get ;

		if( gets.empty() )	gets.push_front( get ) ;
		else
		{
			std::list<int>::iterator i = gets.begin() ;
			while( i != gets.end() )
			{
				if( get >= *i )
				{
					gets.insert( i , get ) ;
					break ;
				}
				else	*i ++ ;
			}
			if( i == gets.end() )	gets.push_back( get ) ;
		}
	}

	for( std::list<int>::iterator i = gets.begin() ; i != gets.end() ; )
	{
		std::cout << *i++ ;
		if( i == gets.end() )	break ;
		else					std::cout << " " ;
	}
	std::cout << std::endl ;

	return 0 ;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[11],date[11];
	for (int i = 1; i <= 5; i++) {
		cin >> a[i];
	}
	int dai = -999999;
	int o;
	for (int i = 1; i <= 5; i++) {
		int dai = -999999;
		for (int z = 1; z <= 5; z++) {
			if (dai <= a[z]) {
				dai = a[z];
				o = z;
			}
		}
		date[i] = dai;
		a[o] = -9999999;
	}
	for (int i = 1; i <= 4; i++) {
		cout << date[i]<<" ";
	}
	cout << date[5];
}

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;
        }else{
            cout<<" ";
        }
    }   
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
 
int main(){
	int tem;
	vector<int> v1;
	for(int i=0;i<5;i++)
		cin >> tem,v1.push_back(tem);
	sort(v1.begin(),v1.end(),greater<int>());
	for(int i=0;i<5;i++)
		cout << (i?" ":"")<< v1[i] ;
	cout << endl;
    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++)
    for(int i=0;i<5;i++)
      if(a[i]<a[i+1]) swap(a[i],a[i+1]);
  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  cout<<endl;
  return 0;
}

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

int main(){
   int num[5];
   int M1 = -2147483647, M2 = -2147483647, M3= -2147483647 , M4= -2147483647 , M5 = -2147483647;
   int I1 = 0, I2 = 0, I3= 0 , I4= 0 , I5 = 0 ;
   cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4] ;

   for(int i=0 ; i < 5; i++){
      if(M1 < num[i]) {
          M1 = num[i];
          I1 = i;
       }
    }

    for(int i=0 ; i < 5; i++){
        if(i == I1 ) continue;
        if(M2 < num[i]) {
           M2 = num[i];
           I2 = i;
        }
     }

for(int i=0 ; i < 5; i++){
if(i == I1 || i == I2 ) continue;
if(M3 < num[i]) {
M3 = num[i];
I3 = i;
}
}

for(int i=0 ; i < 5; i++){
if( i == I1 || i == I2 || i == I3 ) continue;
if(M4 < num[i]) {
M4 = num[i];
I4 = i;
}
}

for(int i=0 ; i < 5; i++){
if( i == I1 || i == I2 || i == I3 || i == I4 ) continue;
if(M5 < num[i]) {
M5 = num[i];
I5 = i;
}
}

cout << M1 << " " << M2 << " " << M3 << " " << M4 << " " << M5 << endl;

return 0 ;
}

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

#define FOR(var, start, end)    for(var = start; var < end; ++var)
#define WHILE(var, end)  while(var != end)
#define SHOW_ALL(a, b, c)    cout << a << endl; \
                                cout << b << endl; \
                                cout << c << endl;

using namespace std;


void BubbleSort(vector <int> &num)
{
      int i, j, flag = 1;    // set flag to 1 to start first pass
      int temp;             // holding variable
      int numLength = num.size( ); 
      for(i = 1; (i <= numLength) && flag; i++)
     {
          flag = 0;
          for (j=0; j < (numLength -1); j++)
         {
               if (num[j+1] > num[j])      // ascending order simply changes to <
              { 
                    temp = num[j];             // swap elements
                    num[j] = num[j+1];
                    num[j+1] = temp;
                    flag = 1;               // indicates that a swap occurred.
               }
          }
     }
     return;   //arrays are passed to functions by address; nothing is returned
}

int main()
{
    int input;
    vector<int> input_array;
    while(cin >> input){
        input_array.push_back(input);
    }
    BubbleSort(input_array);
    printf("%d %d %d %d %d", input_array[0],input_array[1],input_array[2],input_array[3],input_array[4])

    
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>

using namespace std;

int main() {
	long long int a,b,c,d,e;
	long int s[5];
	cin >> a>>b>>c>>d>>e;
	s[0]=a;
	s[1]=b;
	s[2]=c;
	s[3]=d;
	s[4]=e;
	for(int i=4;i>0;i--)
		cout << s[i] << " ";
	cout << s[0] <<endl;
	
	return 0;
}

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

int main(void) {
    vector<int> vec(5);
    cin >> vec[0] >> vec[1] >> vec[2] >> vec[3] >> vec[4];
    sort(vec.begin(), vec.end(), greater<int>());
    for(int r = 0; r < 5; r++) {
        cout << vec[r];
        if(r == 4) cout << endl;
        else       cout << " ";
    }
    return(0);
}

C++: #include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<iomanip>
#include<string>
#include<algorithm>
using namespace std;

int gcd(long long int m,long long int n){
	while(m!=n){
		if(m>n){m=m-n;
		}
		else n=n-m;
	}
	return m;
}
int lmc(long long int m,long long int n){
return m*n/gcd(m,n);
}

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