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>
std::vector<int> qsort(std::vector<int> xs);


int main(){
	std::vector<int> vec(5);
	for(int i=0;i<5;i++){
		std::cin>>vec[i];
	}
	vec=qsort(vec);
	for(int i=0;i<5;i++){
		std::cout<<vec[i];
		std::cout<<" ";
	}
	std::system("pause");
	return 0;
}

std::vector<int> qsort(std::vector<int> xs){

	if(xs.empty())return xs;
	else{
			int x=xs[0];
		std::vector<int> left;
		std::vector<int> right;
		for(int i=1;i<xs.size();i++){
			if(x>xs[i])left.push_back(xs[i]);
			else if(x<=xs[i])right.push_back(xs[i]);
		}
		left=qsort(left);
		right=qsort(right);
		left.push_back(x);
		left.insert(left.end(),right.begin(),right.end());
		return left;
	}
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
 
using namespace std;
 
int main(){
 
    int array[5];
    scanf("%d %d %d %d %d",&array[0],&array[1],&array[2],&array[3],&array[4]);
 
    for(int i=1;i<=4;i++){
        for(int k=4;k>=i;k--){
            if(array[k]>array[k-1])swap(array[k],array[k-1]);
        }
    }
 
    for(int i=0;i<4;i++)printf("%d ",array[i]);
    printf("%d\n",array[4]);
 
    return 0;
}

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

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

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int main() {
	int a[5];
	rep(i, 5)scanf("%d", &a[i]);
	sort(a, a + 5, greater<>());
	rep(i, 5)cout << a[i] << (i == 4 ? '\n' : ' ');
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
    vector<int> vc;
    int x;
    for(int i=0;i<5;i++){
        cin >> x;
        vc.push_back(x);
    }
    sort(vc.rbegin(),vc.rend());
    for(int i=0;i<vc.size();i++){
        cout << vc[i] << " ";
    }
    cout << endl;
    return 0;
}

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

int main()
{
	vector<int> n;
	int x;
	for (int i = 0; i < 5; ++i){
		cin >> x;
		n.push_back(x);
	}

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

	for (int i = 0; i < 5; ++i){
		cout << n[i];
		if (i != 4)
			cout << " ";
	}

	return 0;
}

C++: #include<numeric>
#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,greater<int>());
    for(int i=0;i<5;i++) cout<<(i?" ":"")<<a[i];
    cout<<endl;
    return 0;
}

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

int main(){
  vector<int> array;
  int tmp;
  for(int i=0;i<5;i++){
    cin >> tmp;
    array.push_back(tmp);
  }

  sort(array.begin(), array.end(), std::greater<int>());

  for(int i=0;i<array.size();i++){
    cout << array[i] << ((i!=4)?' ':'\n');
  } 
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>

typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;

int main(){
	int n = 5;

	vector<int> aa;

	REP(i, n){
		int a;
		cin >> a;
		aa.push_back(a);
	}

	sort(aa.begin(), aa.end());

	int i(0);
	for (auto x : aa){
		cout << x;
		if (i != 4){
			cout << " ";
		}
		++i;
	}
	cout << endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(void){
    // Here your code !
int a[4];

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<<a[0]<<endl;
}

C++: #include<stdio.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include<math.h>
#include <algorithm>
using namespace std;



int main(void)
{
  int i=0;
  int aiTable[5];
  int v[5];

cin>>aiTable[0]>>aiTable[1]>>aiTable[2]>>aiTable[3]>>aiTable[4];
 sort(aiTable, aiTable + 5);

for(i=0;i<5;i++)
{
v[4-i]=aiTable[i];
}

for(i=0;i<5;i++)
    {
	cout<<v[i];
	if(i<4){cout<<" ";}
    }
cout<<endl;
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};

priority_queue<int> S;

int main()
{
  for(int i = 0;i < 5;i++){
    int x;
    cin >>x;
    S.push(x);
  }
  for(int i = 0;i < 5;i++){
    cout <<S.top();
    S.pop();
    if(i !=4)
      cout <<" ";
    else
      cout <<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main() {
  int a, b, c, d, e;
  vector<int> v;
  scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
  v.push_back(a);
  v.push_back(b);
  v.push_back(c);
  v.push_back(d);
  v.push_back(e);
  sort(v.begin(), v.end(), greater<int>);
  for (int i = 0; i < v.size(); ++i) {
    cout << v[i];
    if (i < v.size() - 1) {
      cout << " ";
    }
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

using namespace std;

int num[5];

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

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

		for( int i=0;i<5;i++)
		{
			cout << num[i] << " ";
		}

	return 0;
}