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 <vector>
#include <algorithm>
#include <iostream>

int main() {
	std::vector<int> array;
	for (int i = 0; i < 5; ++i) {
		int input;
		std::cin >> input;
		array.push_back(input);
	}
	std::sort(array.begin(), array.end());
	for (std::vector<int>::reverse_iterator it = array.rbegin();;) {
		std::cout << *it;
		++it;
		if (it == array.rend()) { break; }
		std::cout << ' ';
	}
	std::cout << '\n';
	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] ;
	}
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	vector<int> v(5);
	REP(i, 0, 5) cin >> v[i];
	SORT(v);
	for (int i = 4; i > -1;i--) {
		if(i!=0)  cout << v[i] <<" ";
		else cout << v[i];
	}

	return 0;
}

C++: #include<cstdio>
#include<iostream>
int a[5];
int swa;
int change(int n){
    swa=a[n],a[n]=a[n-1],a[n-1]=swa;
}
int main(){
    for(int i=0;i<5;i++)
        scanf("%d",&a[i]);
    for(int i=4;i>=0;i--){
        for(int j=4;j>0;j--){
            if(a[j-1]<a[j])
                change(j);
        }
    }
    for(int i=0;i<4;i++)
        printf("%d ",a[i]);
        printf("%d\n",a[4]);
    return 0;
}

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

using namespace std;

int main() {
  array<int, 5> a;
  for (int& i : a) cin >> i;
  sort(a.begin(), a.end(), greater<int>());
  for (int i = 0; i < int(a.size()); ++i) {
    cout << a[i];
    if (i != int(a.size()) - 1) cout << " ";
    else cout << endl;
  }
}

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

int main() {
    vector<int> v(5);
    for (int i=0; i<5; ++i) {
        cin >> v[i];
    }
    sort(v.begin(), v.end(), greater<int>());
    for (int i=0; i<5; ++i) {
        cout << (i == 0 ? "" : " ") << v[i];
    }
    cout << endl;
    return 0;
}

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

using namespace std;

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

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);
/*    for(auto num:input_array){
        cout << num << " ";
    }*/
    
}

C++: #include<stdio.h>
int main()
{
int n[6]={},x;
for(int i=0;i<5;i++)
{scanf("%d",&n[i]);}
 
for(int i=0;i<5;i++){
for(int j=4;j>i;j--){
if(n[j]>n[j-1]){int t=n[j-1];n[j-1]=n[j];n[j]=t;}
}}
for(int i=0;i<5;i++)
{if(i>0)printf(" ");
printf("%d\n",n[i]);}
return 0;
}

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

using namespace std;

int main (void) {
    int n[5];
    for (int i = 0; i < 5; i++) {
        cin >> n[i];
    }
    for (int i = 0; i < 5; i++) {
        for (int j = i + 1; j < 5; j++) {
            if (n[i] < n[j]) {
                swap(n[i], n[j]);
            }
        }
    }
    for (int i = 0; i < 5; i++) {
        if (i) cout << ' ';
        cout << n[i];
    }
    cout << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(void){
    std::deque<int> deq;
    int a;
    while (cin >> a) {
        deq.emplace_back(a);
    }
    sort(deq.begin(),deq.end(),greater<int>());
    for (int i=0;i<deq.size();i++) {
        if (i==deq.size()-1) {
            cout << deq[i] << endl;
        } else {
            cout << deq[i] << " ";
        }
    }
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <vector>
#include <list>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <complex>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
const double PI = 3.141592653589793238462643383279502884L;
const int LARGE_PRIME = 1000000007;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i,a,cont,next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i,a,b,s) repfn(i,a,i<b,i+s)
#define repab(i,a,b) repby(i,a,b,1)
#define rep(i,b) repab(i,0,b)
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  vi v;
  int tmp;

  rep (i, 5) {
    cin >> tmp;
    v.pb(tmp);
  }
  sort(rall(v));

  tr (v, i) {
    cout << *i;
    if (i+1!=v.end())
      cout << " ";
  }
  cout << endl;

  return 0;
}

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

int main()
{
    int i,a[5];
    for(i=0;i<5;i++)
        cin>>a[i];
    sort(a,a+5);
    for(i=4;i>0;i--)
        cout<<a[i]<<" ";
    cout<<a[i]<<endl;
    return 0;
}

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

int main(){
	char ch[5];
	for( int i = 0; i < 5; i++ ){
		cin >> ch[i];
	}
	sort(ch, ch+4, greater<int>());
	for( int i = 0; i < 4; i++ ){
		cout << ch[i] << " ";
	}
	cout << ch[4] << endl;
}