Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var a, b, c, d, e int
	fmt.Scan(&a, &b, &c, &d, &e)
	dataset := []int{a, b, c, d, e}

	sort.Sort(sort.Reverse(sort.IntSlice(dataset)))
	fmt.Printf("%d %d %d %d %d\n", dataset[0], dataset[1], dataset[2], dataset[3], dataset[4])
}

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

using namespace std;

#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TEMP_T T    cums(T& v){ T r(v.size()); partial_sum(v.begin(), v.end(), r); return r; }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ for(int i=0; i<v.size()-1; i++) cout << v[i] << delim; cout << v[v.size()-1] << end; }
TEMP_T T    acum(vector<T>& v, T b=0){ return accumulate(v.begin(), v.end(), b); }
TEMP_T vector<T> inpt(int n){ vector<T> v(n); for (int i=0; i<n; i++) cin >> v[i]; return v; }

static inline int in(){ int x; scanf("%d", &x); return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};

struct Field {
  Field(int w, int h) : w(w), h(h) {}
  bool invalid(int x, int y){ return x < 0 || w <= x || y < 0 || h <= y; }
  const int w, h;
};

struct Solver {
  Solver(){}
  int solve(){
  }
};

int main()
{
  vector<int> vs = inpt<int>(5);
  sort(vs);
  revs(vs);
  show(vs);
  return (0);
}

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