Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var a, b, c, d, e int
	fmt.Scan(&a, &b, &c, &d, &e)
	dataset := []int{a, b, c, d, e}

	sort.Sort(sort.Reverse(sort.IntSlice(dataset)))
	fmt.Printf("%d %d %d %d %d\n", dataset[0], dataset[1], dataset[2], dataset[3], dataset[4])
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }
int ConvertInt(string s){ int a = 0; rep(i, s.size())if(s[i]!='-')a+=(s[i]-'0')*pow(10,(float)s.size()-i-1); return s[0]!='-'?a:-a;}

vector<string> split(string str, string delim)
{
    vector<string> result;
    int cutAt;
    while( (cutAt = str.find_first_of(delim)) != str.npos )
    {
        if(cutAt > 0)
        {
            result.push_back(str.substr(0, cutAt));
        }
        str = str.substr(cutAt + 1);
    }
    if(str.length() > 0)
    {
        result.push_back(str);
    }
	return result;
}

int main()
{
	vint v(5);
	string str;

	getline(cin, str);
	vector<string> vs = split(str, " ");

	rep(i, 5)
		v[i] = ConvertInt(vs[i]);

	sort(ALL(v), greater<int>());
	
	rep(i, 5)
		cout << v[i] << (i != 4 ? " " : "");
	
	cout << endl;
}

C++: #include <iostream>

using namespace std;
int main(void){
    
    int s[5];
    int i,k;
    int tmp;
    
    for(i=0; i < 5 ; i++)
    {
        cin >> s[i];
    }
    
    for(i=0; i<4;i++)
    {
        for(k=i+1; k<5;k++)
        {
            if(s[i]< s[k])
            {
                tmp = s[k];
                s[k] = s[i];
                s[i] = tmp;
            }
        }
    }
    
    i = 0;
    while(1)
    {
        cout << s[i++];
        
        if(i==5)
            break;
            
        cout << " ";
    }
    
    cout << endl;
    
}

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

#define pb(n) push_back(n)
#define fi first
#define se second
#define X real()
#define Y imag()
#define all(r) (r).begin(),(r).end()
#define gsort(r) sort(all(r),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using comd = complex<double>;
using pii = pair<int,int> ;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(all(v),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  vary(int,v,5,0);
  rep(i,5) cin>>v[i];
  sort(all(v),greater<int>());
  rep(i,4)cout << v[i]<<" ";
  cout << v[4] << 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 j=4;j>=0;j++){
		if(j==0)cout<<a[0]<<endl;
		else cout<<a[j]<<" ";
	    }
	return 0;
	}

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

int main(){
	vector<int> a;
	int n;

	for(int i=0 ; i<5 ; i++){
		cin >> n;
		a.push_back(n);
	}
	sort( a.begin(), a.end(), greater<int>());
	for(int i=0 ; i<=4 ; i++){
		cout << a[i];
	}
	cout << endl;
}

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

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

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

  cout << in[0];
  for (int i = 1; i < in.size(); ++i)
    cout << " " << in[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);
	for(int i=4;i>=0;i--){
		cout<<a[i];
		i==0?cout<<endl:cout<<" ";
	}
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<functional>
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]<<" ";

	
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  vector<int> a;
  for(int i=0;i<5;i++){
    int b;cin>>b;
    a.push_back(b);
  }
  sort(a.begin(),a.end());
  for(int i=0;i<5;i++){
    cout<<a[4-i];
    if(i!=4)
      cout<<" ";
  }cout<<endl;
  return 0;
}

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

using namespace std;

int main()
{
	int i;
	int num[5];
	
	for(i = 0; i < 5; i++)
	{
		cin >> num[i];
	}
	
	sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 5; i++)
	{
		cout << num[i] << " " ;
	}
	
	
	
	return 0;
	
}

C++: #include<iostream>

int main(){
  int a,b,c,d,e;
  scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
  //std::cout << a << b << c << d << e << std::endl;
  int flag = 0,temp;
  do{
    flag = 0;
    if(a<b){
      temp = a;
      a = b;
      b = temp;
      flag = 1;
    }
    if(b<c){
      temp = b;
      b = c;
      c = temp;
      flag = 1;
    }
    if(c<d){
      temp = c;
      c = d;
      d = temp;
      flag = 1;
    }
    if(d<e){
      temp = d;
      d = e;
      e = temp;
      flag = 1;
    }
  }while(flag);
  printf("%d %d %d %d %d\n",a,b,c,d,e);
}

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

using namespace std;

int main(int argc, char const* argv[])
{
	int target[5];

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

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

	for( int i = 0;i < 5;i++ ){
		cout << ( i == 0 ? "" : " " ) << target[i];
	}
	cout << endl;
	return 0;
}

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() ; *i ++ )
	{
		std::cout << *i << " " ;
	}
	std::cout <<std::endl ;

	return 0 ;
}