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 <cstdio>
#include <set>
#include <utility>

int main() {
    std::set<int> s;
    
    int a;
    while (~scanf("%d", &a)) {
       s.insert(a);
    }
    for (auto i = s.rbegin(); i != s.rend(); ++i) {
        printf("%d ", *i);
    }
    printf("\n");
}

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

bool big_order(int a, int b){return (a>b);}

int main(int argc, char *argv[]) {
	int array[5];
	
	fscanf(stdin, "%d %d %d %d %d", &array[0], &array[1], &array[2], &array[3], &array[4]);
	sort(array, array+sizeof(array)/sizeof(int), big_order);
	printf("%d", array[0]);
	for (int i = 1; i < 5; i++) {
		printf(" %d", array[i]);
	}
	fflush(stdout);
	printf("\n");
	return 0;
}

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

int main () {
	
	std::vector<int> n(5);
	for(int i = 0; i < 5; i++){
		cin >> n[i];
	}
	sort(n.begin(),n.end());
	for(int i = 0; i < 5; i++){
		cout << n[4-i];
		if(i != 4){
			cout << " ";
		}
	}
	cout << endl;
}

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

using namespace std;

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

  for (int i = 0; i < 5; i++)
    cin >> nums[i];

  sort(nums, nums + 5);

  for (int i = 0; i < 5; i++) {
    cout << nums[4 - i];
    if (i == 4)
      cout << endl;
    else
      cout << ' ';
  }
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string>
#include<cmath>
#include<math.h>
#include<vector>
#include<stdlib.h>
#include<algorithm>

using namespace std;

#define OUT cout <<
#define IN cin >>
#define E << endl;
#define FOR(i,a,b) for(int i = a;i < b;i++)

vector<int> array;

void input(){
	int temp = 0;
	FOR(i, 0, 5){
		IN temp;
		array.push_back(temp);
	}; 
}

int main(){
	input();
	sort(array.begin(), array.end());
	
	OUT array[0];

	FOR(i, 1, 5){
		OUT " " << array[i];
	}
	OUT endl;
}

C++: #include <iostream>

int main() {
	const int size = 5;
	int arr[size];
	std::cin
		>> arr[0]
		>> arr[1]
		>> arr[2]
		>> arr[3]
		>> arr[4];

	// sort
	for (int i = 0; i < size; i++)
		for (int j = i + 1; j < size; j++)
			if (arr[i] < arr[j]) {
				std::swap(arr[i], arr[j]);
			}
			

	// show
	for (int i = 0; i < size; i++)
		std::cout << arr[i] << " ";

	std::cout << std::endl;
}

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

using namespace std;

/*-------------------------------*/
#define FOR(i, a, b) for(int i = (a); i < (b); i++)  //a~(b - 1)?????§
#define print(i) cout << i << endl //?°??????????Python?????????
#define all(i) (i).begin(),(i).end() //??¨??????(sort??¨???)
#define mp make_pair //mp(OO, OO)??¨???:::pint??¨???

typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<long long> llv;
typedef vector<pint> vpint;
/*-------------------------------*/

int main(void)
{
  vi a;
  int b;
  FOR(i, 0, 5){
    cin >> b;
    a.push_back(b);
  }
  sort(all(a));
  reverse(all(a));
  FOR(i, 0, 5){
    if (i < 4){
      cout << a[i] << " ";
    }
    else{
      cout << a[i] << endl;
    }
  }
  return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int          input;
    vector<int>  array;
    for (int i=0; i<5; ++i) {
        cin >> input;
        array.push_back(input);
    }
    sort(array.begin(), array.end(), greater<int>());
    for (unsigned int i=0; i<5; ++i) {
        cout << array[i];
        if (i!=4) cout << ' ';
    }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
    int          input;
    vector<int>  array;
    for (int i=0; i<5; ++i) {
        cin >> input;
        array.push_back(input);
    }
    sort(array.begin(), array.end(), greater<int>());
    for (unsigned int i=0; i<5; ++i) {
        cout << array[i];
        cout << (i==4 ? '\n' : ' ');
    }
}

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

int main(){
  vector<int> num(5);
  scanf("%d %d %d %d %d", &num[0], &num[1], &num[2], &num[3], &num[4]);

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

  printf("%d %d %d %d %d\n", num[0], num[1], num[2], num[3], num[4]);
  return EXIT_SUCCESS;
}

C++: #include <stdio.h>

int main(void)
{
    int i, j, t, a[5];
    for(i=0; i<5; i++) scanf("%d", &a[i]);

    for(i=0; i<5; i++) {
        for(j=0; j<4; j++) {
            if(a[j] < a[j+1]) {
                t = a[j];
                a[j] = a[j+1];
                a[j+1] = t;
            }
        }
    }

    printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
    return (0);
}

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

using namespace std;

int main(){

	vector<int> v;

	for(int i=0;i<5;i++){
		int a;
		cin>>a;
		v.push_back(a);
	}

	sort(v.rbegin(),v.rend());

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

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
bool func(int a,int b)
{
    return (a>b);
}
int main()
{
    int ara[100000],i;
    for (i=0;i<5;i++)
    {
        scanf ("%d",&ara[i]);
    }
    sort(ara,ara+5,func);
    for (i=0;i<5;i++)
    {
        printf ("%d",ara[i]);
        if (i<4)
            cout<<" ";
    }
    cout<<endl;
}

C++: #include <stdio.h>

int main(void) {
  int a[5], i, j, t;
  for(i = 0; i < 5; ++i) scanf("%d", &a[i]);
  for(i = 0; i < 5; ++i) for(j = i + 1; j < 5; ++j) if(a[i] < a[j]) t = a[i], a[i] = a[j], a[j] = t;
  for(i = 0; i < 4; ++i) printf("%d ", a[i]);
  printf("%d\n", a[4]);
  return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main() {
	int a,i,j,change;
	for(int k=0;k<5;k++){
            cin>>a;
            s.push_back(a);
        }
	for (i = 0; i < 4; i++) {
		for (j = 0; j < 4-i; j++) {
			if (s[j] < s[j + 1]) {
				change = s[j];
				s[j] = s[j+1];
				s[j+1] = change;
			}
		}
    }
	cout << s[0] << " " << s[1] << " " << s[2] << " " << s[3] << " " << s[4];
	return 0;
}

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

int main(void)
{
	vector<int> v;
	int tmp;
	for (int i = 0; i < 5; i++) {
		cin >> tmp;
		v.push_back(tmp);
	}
	stable_sort(v.begin(), v.end(), greater<int>());
	for (int i = 0; i < 4; i++) cout << v[i] << " ";
	cout << v[4] << endl;
	
	return 0;
}

C++: #include <iostream>
using namespace std;
void swap(int *x, int *y)
{
	int tmp = *x;
	*x = *y;
	*y = tmp;
}

void sort(int date[], int n)
{
	int k = n-1;
	while(k>=0){
		int i,j;
		for (i=1, j=-1; i <=k; i++)
			if(date[i-1] < date[i]) {
				j = i-1;
				swap(&date[i], &date[j]);
			}
		k = j;
	}
}

int main(void)
{
	int n[5];
	while(cin >> n[0]){
		for(int i = 1; i < 5; i++){
			cin >> n[i];
		}
		sort(n, 5);
		for(int i=0; i<5; i++){
			cout << n[i];
			if(i!=4) cout << " "; 
		}
		cout << endl;
	}
	return(0);
}

C++: #include<cstdio>

int main(){
	int a[5];
	int t;
	scanf("%d %d %d %d %d", &a[0],&a[1],&a[2],&a[3],&a[4]);
	for(int i = 0; i < 4; i++){
		for(int j = 0; j <= i; j++){
			if(a[i - j] < a[i - j + 1]){
				t = a[i - j];
				a[i - j] = a[i - j + 1];
				a[i - j + 1] = t;
			}
		}
	}
	printf("%d %d %d %d %d\n", a[0],a[1],a[2],a[3],a[4]);
	return 0;
}