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<iostream>
using namespace std;

int main(){
	int num[5];
	if( cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4] ){
		for( int i=0;i<5;i++ ){
			for( int j=4;j>i;j-- ){
				if( num[j] <= num[j-1] ){
					int t = num[j];
					num[j] = num[j-1];
					num[j-1] = t;
				}
			}
		}
		cout << num[4] << " " << num[3] << " " << num[2] << " " << num[1] << " " << num[0] << endl;
	}
	return 0;
}

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

using namespace std;
int main(){
	int a[5];
	scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
	sort(a,a+5);
	for(int i=4;i>=1;i--)cout<<a[i]<<' ';
	cout<<a[0];
}

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

using namespace std;

void Sort()
{
    int a[5];
    
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
        
    sort (a, a + 5, greater<int>()); //sorting from big int
        
    for(int i = 4; i >= 0; i--)
    {
        cout<<a[i]<<" ";
    }
    
    return;
}

int main()
{
    Sort();
    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int n,i,j,swap,arr[100];

    for(i=0;i<5;i++)
    {
        cin>>arr[i];
    }
    for(i=0;i<4;i++)
        for(j=0;j<5-i-1;j++)
    {
        if(arr[j]<arr[j+1])
            {
                swap=arr[j];
        arr[j]=arr[j+1];
        arr[j+1]=swap;

            }

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

    return 0;
    }

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

int main()
{
	vector<int> Number(5);
	for(int i = 0; i < 5; i++){
		scanf("%d", &Number[i]);
	}
	sort(Number.begin(), Number.end(), greater<int>());
	for(int i = 0; i < 5; i++){
		printf("%d", Number[i]);
		if(i != 4){
			printf(" ");
		}else{
			printf("\n");
		}
	}
	return 0;
}

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

int main(void){
    int a[5];
    for(int i=0;i<5;i++) std::cin>>a[i];
    std::sort(a,a+5);
    for(int i=4;i>=0;i--) std::cout<<(i==4?"":" ")<<a[i];


    return 0;
}

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

int main(){
	int data[5];
	for(int i=0;i<5;i++)
		cin >> data[i];
	sort(data,data+5,greater<int>());
	for(int i=0;i<5;i++)
		cout << data[i] << (i==4?"\n":" ");
	
}

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

int main()
{
	int ary[5];
	for (int i = 0; i < 5; i++) cin >> ary[i];
	for (int i = 0; i < 5; i++)
	{
		for (int j = i + 1; j < 5; j++)
		{
			if (ary[i] < ary[j]) swap(ary[i], ary[j]);
		}
	}
	for (int i = 0; i < 5; i++)
	{
		if (i != 0) cout << " ";
		cout << ary[i];
	}
	cout << endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
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>
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] << " ";
	}
	cout << a[0] << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a[10]={};
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=1;i<5;i++)
      if(a[i-1]<a[i]) swap(a[i-1],a[i]);

  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  cout<<endl;
  return 0;
}

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

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

C++: #include <stdio.h>

int main(){
    int a[5],tmp;
    int i,j;
    for(i=0;i<5;i++)scanf("%d",&a[i]);
    for(i=0;i<5;i++){
        for(j=4;j>i;j--){
            if(a[i]<a[j]){
                tmp = a[j];
                a[j] = a[i];
                a[i] = tmp;
            }
        }
    }
    for(i=0;i<5;i++){
        printf("%d",a[i]);
        printf((i-4)? " " : "\n");
    }
}

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

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

for(i=5;i>0;)
    {
		i--;
	cout<<aiTable[i]<<" ";
    }
cout<<endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main(){
	vector<int> a(5);
	for(int i=0; i<5; i++){
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	for(int i=4; i>0; i--){
		cout << a[i] << " ";
	}
	cout << a[0] << endl;
	return 0;
}

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

using namespace std;
int main()
{
	int i, j;
	int num[5];
	
	for(i = 0; i < 5; i++)
	{
		cin >> num[i];
	}
	
	stable_sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 4; i++)
	{
		cout << num[i] << " ";
	}
		
		cout << num[4] << endl;
	
	return 0;
}