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>
#include <algorithm>
#include <deque>

using namespace std;

int main() {

	int i, j;
	deque <int> n;

	for(i=0; i<5; i++) {
		cin >> j;
		n.push_back(j);
	}

	sort(n.begin(), n.end());

	for(i=4; i>0; i--) {
		cout << n[i] << " ";
	}

	cout << n[i] << endl;

	return 0;

}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	int a[5];
	for(int i=0;i<5;i++)
		cin>>a[i];
	for(int i=0;i<4;i++){
      for(int j=4;j>i;j--){
	  if(a[j]>a[j-1]){
	      int tmp=a[j];
	      a[j]=a[j-1];
	      a[j-1]=tmp;
	   }
       }
   }
	for(int i=0;i<5;i++)
		cout<<a[i]<<" ";
	cout<<endl;
	return 0;
}

C++: #include <stdio.h>

#define N 5
int main(void){
    int a[N], tmp;
   
    for (int i=0; i<N; i++) scanf("%d", &a[i]);
    for (int i=N-1; i>0; i--){
        for (int j=0; j<i; j++){
            if (a[j] < a[j+1]){
                tmp = a[j];
                a[j] = a[j+1];
                a[j+1] = tmp;
            }
 	}
    }
    for (int i=0; i<N-1; i++) printf("%d ", a[i]);
    printf("%d\n", a[N-1]);
    return 0;
}

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

using namespace std;

int main() {
    vector<int> a(5);
    for (size_t i=0; i<5; ++i)
        scanf("%d", &a[i]);

    sort(a.begin(), a.end(), greater<int>());

    for (size_t i=0; i<5; ++i)
        printf("%d%c", a[i], i<4? ' ':'\n');

    return 0;
}

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

using namespace std;

int main(void)
{
	int a,b,c,d,e;
	while(cin>>a>>b>>c>>d>>e)
	{
		deque<int> nums;
		nums.push_back(a);
		nums.push_back(b);
		nums.push_back(c);
		nums.push_back(d);
		nums.push_back(e);
		sort( nums.begin(), nums.end(), greater<int>() );
		deque<int>::iterator it = nums.begin();
		while( it != nums.end() )
		{
			cout<<*it<<" ";
			++it;
		}
		nums.clear;
		cout<<endl;
	}
	return 0;
}

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

using namespace std;

int main() {

	int a[5];
	int kari;

	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];

	for (int j = 4; j > 0; j--) {
		for (int i = 0; i < j; i++) {
			if(a[i] < a[i+1]) {
				kari = a[i];
				a[i] = a[i+1];
				a[i+1] = kari;
			}
		}
	}

	cout << a[0];

	for (int i = 1; i < 5; i++) {
		cout << " " << a[i] ;
	}

	cout << endl;

	return 0;
}

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int num[5];
  cin >>num[0]>>num[1]>>num[2]>>num[3]>>num[4];
  sort(num,num+5);
  cout <<num[0]<<" "<<num[1]<<" "<<num[2]<<" "<<num[3]<<" "<<num[4]<<endl;
  return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <cmath>
#include <algorithm>
#define DATA_NUM 5
#define swap(type, x, y) do{type temp = x; x = y; y = temp;}while(0);

using namespace std;

void quick_sort(int x[], int left, int right);
int main(void) {
    int x[DATA_NUM] = {0};
    int i;
    
    for(i = 0; i < DATA_NUM; i++)
        scanf("%d", &x[i]);
    
    quick_sort(x, 0, DATA_NUM - 1);
    
    for(i = DATA_NUM - 1; i >= 0; i--) {
        cout << x[i];
        (i) ? putchar(' ') : putchar('\n');
    }
    
    return(0);
}

void quick_sort(int x[], int left, int right) {
    int i, j;
    int pivot;
    i = left;
    j = right;
    pivot = x[(left + right) / 2];
    
    while(1) {
        while(x[i] < pivot) i++;
        while(x[j] > pivot) j--;
        
        if(i >= j) break;
        
        swap(int, x[i], x[j]);
        i++;
        j--;
    }
    if(i - 1 > left) quick_sort(x, left, i - 1);
    if(j + 1 < right) quick_sort(x, j + 1, right);
}

C++: #include <stdio.h> 
void qsort(int *data,int size);
void swap(int *a,int *b);
int main(void){
int i;
int data[5];
for(i=0;i<5;i++) scanf("%d",&data[i]);
qsort(data,5);
for(i=0;i<5;i++) printf("%d ",data[i]);
return 0;
}
void qsort(int *data,int size){
int i,last=1;
if(size<2)return;
for(i=1;i<size;i++){
if(data[0]<data[i]){ swap(&data[last],&data[i]);
last++;
}
}
swap(&data[0],&data[last-1]);
qsort(data,last);
qsort(data+last,size-last);
}
void swap(int *a,int *b){
int work;
work=a[0];
a[0]=b[0];
b[0]=work;
}

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

C++: #include<iostream>
using namespace std;
int main(void)
{
    int num[6],sta;
    for(int i=0;i<5;i++){
        cin>>num[i];
    }
    for(int i=0;i<4;i++){
        for(int j=0;j<4;j++){
            if(num[j]<num[j+1]){
                sta=num[j];
                num[j]=num[j+1];
                num[j+1]=sta;
            }
        }
    }
    for(int i=0;i<5;i++){
        cout<<num[i];
        if(i==4)cout<<"\n";
        else cout<<" ";
    }
}

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

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

  sort(a,a+5);

  for(i=4; i>=0; i--){
    printf("%d",a[i]);
    if(i!=0)printf(" ");
  }
  puts("");
}

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 = 0; i < 5; i++){
		cout << a[4-i] << " ";
	}
	cout << endl;
}

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

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>=0;i--)
   {
       printf("%d",a[i]);
       if(i>0) printf(" ");
       else printf("\n");
   }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int num[5];
  
  for(int i = 0; i = 4; i++)
    cin >> num[i];

  sort(num, num + 5);

  for(int i = 4; i = 1; i--)
    cout << num[i] << " ";

  cout << num[0] << "\n";
}

C++: #include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<complex>
#include<stack>
#include<cmath>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)



int main(){
	
	vector<int> a;
	rep(i,5){
		int b;
		cin>>b;
		a.push_back(b);
	}
	sort(a.begin(),a.end());
	reverse(a.begin(),a.end());
	rep(i,5)printf("%d ",a[i]);puts("");
}

C++: #include <iostream>

using namespace std;

int SolvedPuzzle[100];

int main()
{
    cin >> SolvedPuzzle[0] >> SolvedPuzzle[1] >> SolvedPuzzle[2] >> SolvedPuzzle[3] >> SolvedPuzzle[4];

    for(int x=0; x<4; x++)
    {
        for(int y=0; y<4; y++)
        {
            if(SolvedPuzzle[y]<SolvedPuzzle[y+1])
            {
                int temp;
                temp = SolvedPuzzle[y+1];
                SolvedPuzzle[y+1] = SolvedPuzzle[y];
                SolvedPuzzle[y] = temp;

            }
        }
    }
    cout << SolvedPuzzle[0] << " " << SolvedPuzzle[1] << " " << SolvedPuzzle[2] << " " << SolvedPuzzle[3] << " " << SolvedPuzzle[4] << endl;

}