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 <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

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

    return 0;
}

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

using namespace std;

int n[5];

int main()
{
	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,f;
cin>>a>>b>>c>>d>>e;
if(a<b){f=a;a=b;b=f;}
if(a<c){f=a;a=c;c=f;}
if(a<d){f=a;a=d;d=f;}
if(a<e){f=a;a=e;e=f;}
if(b<c){f=b;b=c;c=f;}
if(b<d){f=b;b=d;d=f;}
if(b<e){f=b;b=e;e=f;}
if(c<d){f=c;c=d;d=f;}
if(c<e){f=c;c=e;e=f;}
if(d<e){f=d;d=e;e=f;}
cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<endl;
return 0;
}

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

using namespace std;


int main(){

	int x[5];

	for (int i = 0; i < 5; i++){
		cin >> x[i];
		x[i] *= (-1);
	}

	sort(x, x + 5);

	printf("%d %d %d %d %d\n", -x[0], -x[1], -x[2], -x[3], -x[4]);

	return 0;
}

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

using namespace std;

int main(){
  vector<int> hoge;
  for(int i=0; i<5; i++){
    int n;
    scanf("%d",&n);
    hoge.push_back(n);
  }

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

  for(int i=0; i<5; i++){
    printf("%d ",hoge[4-i]);
  }
  printf("\n");
}

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

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

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

int main()
{
    int Number[5];
    int Temp;

    while(cin >> Number[0] >> Number[1] >> Number[2] >> Number[3] >> Number[4])
    {
        for(int x = 0; x < 5; x++)
        {
            for(int z = 0; z < 5; z++)
            {
                if(Number[z] < Number[z+1])
                {
                    Temp = Number[z+1];
                    Number[z+1] = Number[z];
                    Number[z] = Temp;
                }
            }
        }

        for(int y = 0; y <4; y++)
        {
            cout << Number[y] << " ";
        }
        cout<<Number[4];
		printf("\n");

    }
	return 0;
}

C++: #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	int a[5];
	rep(i,5) cin>>a[i];

	sort(a,a+5,greater<int>());

	rep(i,5) cout<<a[i]<<" ";

	cout<<endl;

	return 0;
}

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++){
		cout << ary[i];
		if (i != 4)
			cout << ' ';
	}

	cout << endl;

	return 0;
}

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

using namespace std;

int v[5];

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

    sort(v, v + 5);
    reverse(v, v + 5);

    for(int i = 0; i < 4; i++) {
        cout << v[i] << " ";
    }
    cout << v[4];
    return 0;
}

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

#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;

int main(){
	vector<int> ret;
	int a;
	while(cin>>a) ret.push_back(a);
	sort(ret.begin(), ret.end() ,greater<int>());
	REP(i, ret.size()) {
		cout<<ret[i];
		if (i != ret.size() -1)
		{
			cout << " ";
		}
	}
	return 0;
}

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

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<<endl;
		else
			cout<<" ";
	}

	return 0;
}

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

int main(void) {
  int ary[5], i;

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

  std::sort(ary, ary + 5, std::greater<int>());

  for (i = 0; i < 5; i++) {
    std::cout << ary[i];

    if (i == 4) {
      std::cout << std::endl;
    } else {
      std::cout <<  " ";
    }
  }

  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

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

	sort(num, num + 5);

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

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

int main()
{

    int a[100],n=5;
    int temp =0;

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



    for(int i=0;i<n-1;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(a[i]<a[j])
            {

              swap(a[i],a[j]);

            }
        }
    }

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

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

using namespace std;

int main(){
  int a[5];
  while(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;
  }
}

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	vector<int> v;
	for(int i = 0; i < 5; i++){
		int a;
		cin >> a;
		v.push_back(a);
	}
	sort(v.rbegin(), v.rend());
	int cas = 1;
	for(auto i:v){
		if(cas > 1)cout << ' ';
		cas++;
		cout << i;
	}
	cout << '\n';
	return 0;
}
// Write Here

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

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

int main(){
	int n;
	int c=0;
	vector<int> buf;
	while(cin>>n){
		c++;
		buf.push_back(n);
		if(c==5){
			sort(buf.begin(),buf.end());
			reverse(buf.begin(),buf.end());
			for(int i=0; i<buf.size(); i++){
				if(i!=0) cout<<" ";
				cout<<buf[i];
			}
			cout<<endl;
			buf.clear();
			c = 0;
		}
	}
	return 0;
}