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++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main()
{
    int n;
    vector<int> v;
    for(int i=0; cin>>n && i<5; i++) v.push_back(n);
    
    stable_sort(v.begin(), v.end());
    reverse(v.begin(), v.end());

    cout << v.at(0);
    for(int i=1; i<5; i++) cout << " " << v.at(i);
    cout << endl;

    return 0;
}

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  int n[5];

  REP(i, 5) cin >> n[i];
  sort(n, n+5, greater<int>());

  REP(i, 4) cout << n[i] << ' ';
  cout << n[4] << endl;
}

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

int main(){
   int a,i;
   vector<int> s;
   for(i=0;i<5;i++){
      cin>>a;
      s.push_back(a);
   }
   sort(s.rbegin(),s.rend());
   
   printf("%d",s[0]);
   for(i=1;i<5;i++){
      printf(" %d",s[i]);
   }
   printf("\n");
   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 <iostream>
using namespace std;
int main(void){
    long int x[5];
    for(int i = 0; i < 5; i++){
        cin >> x[i];
    }

    int tmp;
    for(int i = 0; i < 5; i++){
        for(int j = i + 1; j < 5; j++){
            if(x[i] < x[j]){
                tmp = x[i];
                x[i] = x[j];
                x[j] = tmp;
            }
        }
    }
    for(int i = 0; i < 5; i++){
        cout << x[i];
        if(i != 4) cout << " ";
        else cout << endl;
    }
}

C++: #include<iostream>

int main(){
	int a[5],i,j,n;
	for(i=0;i<5;i++){
		std::cin>>a[i];
	}
	for(i=0;i<4;i++){
		for(j=i+1;j<5;j++){
			if(a[i]<a[j]){
				n=a[i];
				a[i]=a[j];
				a[j]=n;
			}
		}
	}
	std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4];
return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define ALL(a) begin(a),end(a)
#define ifnot(a) if(not (a))
#define dump(x)  cerr << #x << " = " << (x) << endl
using namespace std;

// #define int ll
#ifdef _MSC_VER
const bool test = true;
#else 
const bool test = false;
#endif

int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
#define INF (1 << 28)
ull mod = (int)1e9 + 7;
//.....................
const int MAX = (int)2e5 + 5;

int main() {
	int a;
	vector<int> v;
	while (cin >> a) {
		v.push_back(a);
	}
	sort(ALL(v),greater<int>());
	cout << v.front();
	REP(i, 1, v.size()) {
		cout << " " << v[i];
	}
	return 0;
}

C++: #include <iostream>
#include <cstdlib>
#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];
    cout << endl;
    return EXIT_SUCCESS;
}

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 <= 5; i++) {
		cout << date[i]<<" ";
	}
}

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

int main(){
	vector<int> v(5);
	for(int i = 0; i < 5; i++){
		scanf("%d",&v[i]);
	}
	sort(v.rbegin(), v.rend());
	for(int i = 0; i < 5; i++){
		printf("%d ", v[i]);
	}
	printf("\n");
	return 0;
}

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

using namespace std;

int main(int argc, char **argv)
{
	int a[5];
	
	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];
	
	sort(a, a+5);
	
	for(int i = 4; i >= 0; i--){
		cout << a[i] << " ";
	}
	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];
	}
	
	stable_sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 5; i++)
	{
		cout << num[i] << " " ;
	}
	
	cout << endl;
	
	
	return 0;
	
}

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

using namespace std;
bool s(int x,int y){return (x>y);}
int main(){
  vector<int> a(5);
  while(cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]){
    sort(a.begin(),a.end(),s);
    for(int i=0;i<4;i++) cout<<a[i]<<" ";
    cout<<a[4]<<endl;
  }
  return 0;
}