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>

int main(void) {

  int seq[5];
  int i,j,temp;

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

  for(i=0;i<4;i++) {
    for(j=0;j<4-i;j++) {
      if(seq[j]<seq[j+1]) {
	temp=seq[j];
	seq[j]=seq[j+1];
	seq[j+1]=temp;
      }
    }
  }

  for(i=0;i<5;i++) {
    if(i==0) printf("%d",seq[i]);
    else printf(" %d",seq[i]);
  }

  puts("");
  
  return 0;
}

C++: #include <algorithm>
int main(){for(int a[5];~scanf("%d%d%d%d%d",a,a+1,a+2,a+3,a+4);printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]))std::sort(a,a+5);}

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

int main(){
  int a, b, c, d, e, f, g, h, i;
  cin >> a >> b >> c >> d >> e;

  if(a > b) f = a, a = b;
  else f = b;

  if(a > c) g = f, f = a, a = c;
  else if(a <= c && c < f) g = f, f = c;
  else g = c;

  if(a > d)  h = g, g = f, f = a, a = d;
  else if(a <= d && d < f) h = g, g = f, f = d;
  else if(f <= d && d < g) h = g, g = d;
  else h = d;

  if(a > e) i = h, h = g, g = f, f = a, a = e;
  else if(a <= e && e < f) i = h, h = g, g = f, f = e;
  else if(f <= e && e < g) i = h, h = g, g = e;
  else if(g <= e && e < h) i = h, h = e;
  else i = e;

  cout << i << " " << h << " " << g << " " << f << " " << a << endl;

  return 0;
}

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

using namespace std;

int main()
{
  vector<int> num;
  int i, x;
  for (i = 0; i < 5; i++) {
    cin >> x;
		num.push_back(x);
  }

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

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

  return 0;
}

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

using namespace std;

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

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

int main(){
  int str[5], i;

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

  sort(str, str + 5);

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

  return 0;
}

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

int main()
{
	int a[5];
	for (int i = 0; i < 5; i++)
	{
		cin >> a[i];
	}
	for (int i = 0; i < 5; i++)
	{
		int x,y;
		x = i;
		y = a[i];
		for (int I = i+1; I < 5; I++)
		{
			if (a[I] > y)
			{
				y = a[I];
				x = I;
			}
		}
		int s=a[i];
		a[i] = a[x];
		a[x] = s;
	}
	for (int i = 0; i < 5; i++)
	{
		cout << a[i];
		if (i != 4)cout << " ";
	}
	cout << endl;
}

C++: #include<iostream>
int main()
{
	int n[5];
	for (int i = 0; i < 5; i++)
	{
		std::cin >> n[i];
	}
	for (int i = 0; i < 5; i++)
	{
		int max = -100001, max_index = 0;
		for (int j = i; j < 5; j++)
		{
			if (max < n[j])
			{
				max = n[j];
				max_index = j;
			}
		}
		std::swap(n[i], n[max_index]);
	}
	for (int i = 0; i < 5; i++)
	{
		std::cout << n[i] << ' ';
	}
	std::cout << std::endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
	int a[5];
	for(int i=0;i<5;i++) cin>>a[i];
	sort(a,a+5,greater<int>());
	for(int i=0;i<5;i++){ 
		cout<<a[i];
		if(i!=4)cout<<" ";
	}
	cout<<endl;
}

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

int main() {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    list<int> lis = {a, b, c, d, e};
    lis.sort(greater<int>());
    list<int>::iterator it = lis.begin();
    while(it != lis.end()) {
        cout << *it << flush;
        it++;
    }
    cout << endl;
    return 0;
}

C++: #include <stdio.h>

int main(void) {
  int a[5], i, j, t;
  for(i = 0; i < n; ++i) scanf("%d", &a[i]);
  for(i = 0; i < n; ++i) for(j = i + 1; j < n; ++j) if(a[i] < a[j]) t = a[i], a[i] = a[j], a[j] = t;
  for(i = 0; i < 4; ++i) printf("%d ", a[i]);
  printf("%d\n", a[4]);
  return 0;
}

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

int main(){
int a;
int b[5];
int c;
int d;
int e;
c=0;
while(c<5){
b[c]=0;
c=c+1;
}
c=0;
while(c<5){
cin >>a;
d=0;
while(1){if(a>=b[d]){e=3; if(e>=d){while(e>=d){b[e+1]=b[e]; e=e-1;}} b[d]=a; break;} d=d+1;     }
c=c+1;
}
c=0;
while(c<5){
cout << b[c]
if(c<4){cout <<" "}
c=c+1;}


}

C++: *a=&a;main(i){*a=~scanf("%d",++a)?!printf(i?"%d\n":"%d ",*--a,main(0)):qsort(a-5,5,4,"YXZRPQ\213\0+\2テδ。");}

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

int main(){
	int a[5];
	int tmp;
	for(int i=0; i<5 ; i++){
		cin >> a[i];
	}
	for(int j=0;j<4;j++){
		for(int k=j+1;k<5;k++){
			if(a[j]<a[k]){
				tmp = a[j];
				a[j] = a[k];
				a[k] = tmp;
			}
		}
	}

	for(int l =0; l<5 ; l++) {
		cout << a[l] << " ";
	}
	cout << "\n";
}

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

using namespace std;

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

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

	cout << a[0];
	for (int i = 1; i < a.size(); ++i)
		cout << " " << a[i];
	cout << endl;

	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
using namespace std;

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

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

using namespace std;

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

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

int main()
{
	std::array<int,5> v;
	std::cin >> v[0] >> v[1] >> v[2] >> v[3] >> v[4];
	std::sort( v.begin(), v.end(), std::greater<int>() );
	std::cout << v[0] << ' ' << v[1] << ' ' << v[2] << ' ' << v[3] << ' ' << v[4] << '\n';
}

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

using namespace std;

int main(void) {
	vector<int> a(5, 0);
	
	for (int i = 0; i < 5; i++){
		cin >> a[i];
	}

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

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

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int a[5];
    for(int i=0; i<5; i++)
        scanf("%d",a+i);
    sort(a,a+5);
    printf("%d",a[4]);
    for(int i=3; i>=0; i--)
        printf(" %d",a[i]);
    return 0;
}

C++: #include <cstdio>
#include <set>
#include <utility>

int main() {
    std::set<int> s;
    
    int a;
    while (~scanf("%d", &a)) {
       s.insert(a);
    }
    for (auto i = s.rbegin(); i != s.rend(); ++i) {
        printf("%d%c", *i, std::next(i) != s.rend() ? ' ' : '\n');
    }
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;

int main() {
	int n[5];
	for (int i = 0; i != 5; ++i) {
		scanf("%d", &n[i]);
	}
	sort(n, n+5);
	printf("%d %d %d %d %d\n", n[4], n[3], n[2], n[1], n[0]);
	return 0;
}

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

int main()
{
	int a, b, c, d, e, a[6], i, j;
	cin >> a >> b >> c >> d >> e;
	a[0] = a;
	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;
}