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<string.h>
int main(void){
    int num[5],i,j,hoge;
    for(i=0;i<5;i++)
        scanf("%d",&num[i]);
    for(i=0;i<4;i++){
        for(j=i+1;j<5;j++){
            if(num[i]<num[j]){
            hoge=num[i];
            num[i]=num[j];
            num[j]=hoge;
            }
        }
    }
    for(i=0;i<4;i++){
        printf("%d ",num[i]);
    }
    printf("%d\n",num[4]);
    return 0;
}

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

	// show
	for (int i = 0; i < size; i++)
		std::cout << arr[i] << " ";

	std::cout << std::endl;
}

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


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

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

int main()
{
 int num[5];
 
 for(int i=0; i<5; i++) cin >> num[i];

 for(int i=0; i<5; i++)
  for(int j=i+1; j<5; j++)
   if(num[i] > num[j]){
    int tmp = num[i];
    num[i] = num[j];
    num[j] = tmp;
   }

 for(int i=0; i<5; i++){
  cout << num[i];
  if(i == 4) break;
  cout << ' ';
 }
 cout << '\n';

 return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
long int a[5];

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

	return 0;
}

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


int main(void) {

  vector<int> a(5);
  for(int i=0; i<5; i++) cin >> a[i];

  sort(a.begin(), a.end());
  for(int i=4; i>=1; i--) cout << a[i] << " ";
  cout << a[0] << endl;
  return 0;
}

C++: #include <bits/stdc++.h>
#include <vector>
using namespace std;
int a[5];
int main(){
	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 << 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!=array.size()) cout << ' ';
    }
}

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--)
	{
		if(i!=4)cout<<" ";
		cout<<a[i];
	}
	cout<<endl;
	return 0;
}

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

int main( void )
{
	while ( !cin.eof() )
	{
		vector <int> v(5);
		for ( int i = 0; i < 5; i++ )
			cin >> v[i];
		if ( cin.eof() )
			break;

		sort( v.rbegin(), v.rend() );

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

	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n;i>=0;i--)
#define all(v) v.begin(),v.end()
template<typename T>T rad(T deg){return deg*M_PI/180;}

using namespace std;
int main() {
    int a[5];
    rep(i,5) cin >> a[i];
    sort(a,a+5);
    cout << a[4];
    rrep(i,3) cout << " " << a[i];
    cout << endl;
    return 0;
}

C++: #include <cstdlib>
#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]);
				continue;
			}
			

	// show
	for (int i = 0; i < size; i++)
		std::cout << arr[i] << " ";

	std::cout << std::endl;
}

C++: #include<iostream>

int main(){
	int a[5],i,j,n;
	for(i=0;i<5;i++){
		std::cin>>a[i];
	}
	for(i=0;i<4;i++){
		for(j=i+1;j<5;j++){
			if(a[i]<a[j]){
				n=a[i];
				a[i]=a[j];
				a[j]=n;
			}
		}
	}
	std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<std::endl;
return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
int a,i,j,k,l,m,n,o;
int A[5];
for(i=0;i<5;i++)
{
	cin>>A[i];
	}	
	for(j=0;j<5;j++)
	{
		if(A[j]>A[0])
		{
			a=A[0];
			A[0]=A[j];
			A[j]=a;
			a=0;
		}
	}
	for(k=1;k<5;k++)
	{
	if(A[k]>A[1])
		{
			a=A[1];
			A[1]=A[k];
			A[k]=a;
			a=0;
		}	
	}
	for(l=2;l<5;l++)
	{
	if(A[l]>A[2])
		{
			a=A[2];
			A[2]=A[l];
			A[l]=a;
			a=0;
		}	
	}
	for(m=3;m<5;m++)
	{
	if(A[m]>A[3])
		{
			a=A[3];
			A[3]=A[m];
			A[m]=a;
			a=0;
		}	
	}
	for(n=4;n<5;n++)
	{
	if(A[i]>A[4])
		{
			a=A[4];
			A[4]=A[n];
			A[n]=a;
			a=0;
		}	
	}
	for(o=0;o<4;o++)
	{
	cout<<A[o]<<" ";
	}
	cout<<A[4]<<endl;
	return 0;
}

C++: #include <stdio.h>
int main() {int RideBack[5],i,j,k;for (i=0;i<5;i++) {scanf("%d",&j);for (k=0;k<i;k++) if (RideBack[k]<j) break;for (int s=4;s>k;s--) RideBack[s]=RideBack[s-1];RideBack[k]=j;} for (i=1,printf("%d",RideBack[0]);i<5;printf(" %d",RideBack[i++]));puts("");return 0;}

C++: #include <iostream>
#include <cstdlib>
#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, greater<int>());
    cout << a[0] << a[1] << a[2] << a[3] << a[4];
    cout << endl;
    return EXIT_SUCCESS;
}

C++: a[],i,j;main(){while(~scanf("%d",a+i))qsort(a,++i,4,"YXZRPQ\213\0+\x2\303");for(;i--;)j=!printf(i?"%d ":"%d\n",a[i]);}

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

int main()
{
	std::vector<int> v(5);

	for(int i=0;i<5;++i)
	{
		std::cin >> v[i];
	}

	std::sort(v.begin(),v.end());

	for(int i=4;i>=0;--i)
	{
		std::cout << v[i] << ' ';
	}

	std::cout << '\n';
}

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

int main(){
    int n,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] ;
        if(i==0)
            cout << endl;
        else
            cout << " ";
    }
}

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

int main()
{
    vector<int> numbers;
    int n;
    while(cin >> n)
    {
        numbers.push_back(n);
    }
    sort(numbers.rbegin(), numbers.rend());
    cout << numbers[0];
    for(int i=1; i<numbers.size(); i++)
    {        
        cout << " " << numbers[i];
    }
    cout << endl;
    return 0;
}

C++: #include <bits/stdc++.h>
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=0; i<4; i++) cout << a[4-i] << " ";
  cout << a[0] << endl;
}

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

using namespace std;

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

C++: #include<iostream>
using namespace std;
int main(){
	int n[5];
	int tmp;
	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]){
				tmp = n[i];
				n[i] = n[j];
				n[j] = tmp;
			}
		}
	}
	for(int i = 0; i<5; ++i){
		if(i = 4) cout << n[i];
		else cout << n[i] << " ";
	}
	return 0;
}