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 <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>

using namespace std;

int main(){

	int array[5];
	scanf("%d %d %d %d %d",&array[0],&array[1],&array[2],&array[3],&array[4]);

	for(int i=1;i<=4;i++){
		for(int k=4;k>=i;k--){
			if(array[k]>array[k-1])swap(array[k],array[k-1]);
		}
	}

	for(int i=0;i<4;i++)printf("%d ",array[i]);
	printf("%d\n",array[4]);

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

  cout << a[4];
  for( int i=3;i>=0;--i )
    cout << " " << a[i];
  cout << endl;

  return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define ALL(a) (a).begin(),(a).end()
#define all(a) (a).begin(),(a).end()

int main(void) {
  vector<int> nums;
  int n;

  rep(i,5){
    cin >> n;
    nums.push_back(n);
  }

  sort(all(nums), greater<int>());

  rep(i,5){
    cout << nums.at(i) << " ";
  }
  cout << endl;
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b,c,d,e;
	cin>>a;
	cin>>b;
	if(a<b){
		int i=0;
		i=b;
		b=a;
		a=i;
	}
	cin>>c;
	if(a<c){
		int i=0;
		i=c;
		c=a;
		a=i;
	}
	if(b<c){
		int i=0;
		i=c;
		c=b;
		b=i;
	}
	cin>>d;
	if(a<d){
		int i=0;
		i=d;
		d=a;
		a=i;
	}
	if(b<d){
		int i=0;
		i=d;
		d=b;
		b=i;
	}
	if(c<d){
		int i=0;
		i=d;
		d=c;
		c=i;
	}
	cin>>e;
	if(a<e){
		int i=0;
		i=e;
		e=a;
		a=i;
	}
	if(b<e){
		int i=0;
		i=e;
		e=b;
		b=i;
	}
	if(c<e){
		int i=0;
		i=e;
		e=c;
		c=i;
	}
	if(d<e){
		int i=0;
		i=e;
		e=d;
		d=i;
	}
	cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e;
}

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

using namespace std;

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

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

int main()
{
	int a[5];
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
	sort(a,a+5);
	cout<<a[4]<< " "
		<<a[3]<< " "
		<<a[2]<< " "
		<<a[1]<< " "
		<<a[0]<<endl;
	return 0;

	
}

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

using namespace std;

int main()
{
int i,j,k,l,m,n=5;
int a[1000];
for(i=0;i<n;i++)
{
cin>>a[i];
}

sort(a,a+5);
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}


return 0;
}

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

using namespace std;

int line[5];

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

C++: #include<bits/stdc++.h>
using namespace std;
signed main(void){
	int a[5];
	for(int i=0;i<5;i++)
		cin>>a[i];
	sort(a,a+5);
	cout<<a[4];
	for(int i=3;i>=0;i--)
		cout<<" "<<a[i];
	cout<<endl;
}

C++: #include <stdio.h>
#include <stdlib.h>

int compare(const void *a, const void *b)
{
  return *(int *)b-*(int *)a;
}

int main(void)
{
  int num[5];

  int i;
  for(i=0; i<5; ++i){
    scanf("%d", &num[i]);
  }

  qsort((void *)num, 5, sizeof(int), compare);

  for(i=0; i<5; ++i){
    printf("%d", num[i]);
    printf("%s", i<4 ? " " : "\n");
  }

  return 0;
}

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

using namespace std;

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

C++: #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  vector<int> v;
  for (int i = 0; i < 5; i++) {
    int n;
    cin >> n;
    v.push_back(n);
  }
  sort(v.begin(), v.end(), greater<int>());
  cout << v[0] << ' ' << v[1] << ' ' << v[2] << ' ' << v[3] << ' ' << v[4] << endl;
}

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

using namespace std;

int main() {
    int a, b, c, d, e;
    vector<int> vec;

    cin >> a >> b >> c >> d >> e;
    vec.push_back(a);
    vec.push_back(b);
    vec.push_back(c);
    vec.push_back(d);
    vec.push_back(e);

    sort(vec.begin(), vec.end(), greater<>());

    for (int i = 0; i < vec.size(); i++) {
        if (i > 0) cout << ' ';
        cout << vec[i];
    }
    cout << endl;
}

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

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

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, c, d, e, x[5], i, j, y;
	cin >> a >> b >> c >> d >> e;
	x[0] = a;
	x[1] = b;
	x[2] = c;
	x[3] = d;
	x[4] = e;
	for ( j = 0;j < 5; j++)
	{	for ( i = 0;i < 4; i++)
		{
			if (x[i] < x[i + 1])
				{
					y = x[i + 1];
					x[i + 1] = x[i];
					x[i] = y;
				}
		}
	}
	cout << x[0] << " " <<x[1] << " " << x[2] << " " << x[3] << " " << x[4];
return 0;
}

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;
	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 <stdio.h>

int main ()
{
	int a[5], swap;
	
	for (int i = 0; i < 5; i++)
		scanf ("%d", &a[i]);
		
	
	for (int i = 0; i < 5; i++)
	{
		
		for (int j = i + 1; j < 5; j++)
		{
			if (a [j] > a[i])
			{
				swap = a[i];
				a[i] = a[j];
				a[j] = swap;
			}

		}
		
	}

	for (int i = 0; i < 5; i++)
	{
		printf ("%d", a[i]);
		
		if ( i != 5)
			printf (" ");
		else
			printf ("\n");
	}

	
	return 0;
}

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

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

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

int main(){
	int n;
	vector<int> array;
	for(int i = 0; i < 5; i++){
		cin >> n;
		array.push_back(n);
	}
	sort(array.begin(), array.end(), greater<int>());
	for(int i = 0; i < 4; i++){
		cout << array[i] << " ";
	}
	cout << array[4] << endl;
	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>
using namespace std;

int main() {
    int numbers[5];
    int x;
    for (int i=0; i<5; i++) {
        cin >> x;
        numbers[i] = x;
    }
    for (int i=0; i<5; i++){
        for (int j=i; j<5; j++){
            if (numbers[j] > numbers[i]){
                int temp = numbers[j];
                numbers[j] = numbers[i];
                numbers[i] = temp;
            }
        }
        cout << numbers[i];
        if (i < 4) {
            cout << ' ';
        }
    }
    return 0;
}