Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

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;
}

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);
}