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<istream>
using namespace std

int main () {
    int i,j,s,w,a[5];
    for(i=0;i<5;i++)
    cin >> a[i];
    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;}  
        }
    }
    for(i=0;i<5;i++) {
        cout << a[i]
        if(i!=4) cout << " ";
        else cout << endl;
    }
}

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

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

}

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<iostream>
#include<vector>
#include<algorithm>
using namespace std;

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

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

int main() {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    vector<int> ary;
    ary.push_back(a);
    ary.push_back(b);
    ary.push_back(c);
    ary.push_back(d);
    ary.push_back(e);
    sort(ary.begin(), ary.end());
    cout << ary[4] << " " << ary[3] << " " << ary[2] << " " << ary[1] << " " << ary[0] << endl;
    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);

	for(int m=4; 0<=m; m--){
		cout << a[m] << " " << endl;
	}
}

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);
	printf("%d %d %d %d %d",num[4],num[3],num[2],num[1],num[0]);
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

using namespace std;

int num[5];

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

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

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

	}	
	return 0;
}

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

int main() {
	multiset<int, greater<int>> mul;
	int temp; bool check = true;
	for (int i = 0; i < 5; i++) {
		cin >> temp; mul.insert(temp);
	}
	auto itr = mul.begin();
	for (int i = 0; i < mul.size(); i++) {
		if (check == false) cout << ' ' << flush;
		cout << *itr << flush; check = false; ++itr;
	}
	cout << endl;
	return 0;
}

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

using namespace std;

int main()
{
	int c[5];
	int i = 0;
	int j = 0;
	int temp = 0;

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

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


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

}

C++: #include<iostream>
#include<vector>
std::vector<int> qsort(std::vector<int> xs);


int main(){
	std::vector<int> vec(5);
	for(int i=0;i<5;i++){
		std::cin>>vec[i];
	}
	vec=qsort(vec);
	for(int i=0;i<5;i++){
		std::cout<<vec[i];
		std::cout<<" ";
	}
	
	return 0;
}

std::vector<int> qsort(std::vector<int> xs){

	if(xs.empty())return xs;
	else{
			int x=xs[0];
		std::vector<int> left;
		std::vector<int> right;
		for(int i=1;i<xs.size();i++){
			if(x>xs[i])left.push_back(xs[i]);
			else if(x<=xs[i])right.push_back(xs[i]);
		}
		left=qsort(left);
		right=qsort(right);
		left.push_back(x);
		left.insert(left.end(),right.begin(),right.end());
		return left;
	}
}

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

C++: #include <iostream>
#include <stdio.h>
#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,greater<int>());

	for(int i=0; i<5; i++)
	{
		printf("%d",a[i]);
		printf(" ");
	}
	cout << endl;

	return 0;
}

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

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

int main(){
	vector<int> s(5);
	for( auto &&i : s ) cin >> i;
	sort(s.rbegin(),s.rend());
	cout << s[0];
	for(int i = 1 ; i < 5 ; i++) cout << " " << s[i];
	cout << endl;
}

C++: puts gets.split.map(&:to_i).sort.reverse * " "

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

bool smaller(const int left, const int right) {
	return left>right;
}

int main()
{
	vector<int> num;
	for (int i=0; i<5; i++) {
		int tmp;
		cin >> tmp;
		num.push_back(tmp);
	}
	sort(num.begin(),num.end(),smaller);
	for (int i=0; i<4; i++) {
		cout << num[i] << ' ';
	}
	cout << num[4] << endl;
	return 0;
}

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

int main(){
	int a[5];
	for(int i=1;i<6;i++){
		cin>>a[i];
	}
	sort(a+1,a+6);
	for(int i=5;i>0;i--){
		cout<<a[i]<<' ';
}
	cout<<endl;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int main(){
    vector<int> vc;
    int x;
    for(int i=0;i<5;i++){
        cin >> x;
        vc.push_back(x);
    }
    rsort(vc.begin(),vc.end());
    for(int i=0;i<vc.size();i++){
        cout << vc[i] << " ";
    }
    cout << endl;
    return 0;
}

C++: #include <algorithm>
#include <iostream>
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>());
  for (int i = 0; i < 5; ++i)
    if (i == 4)
      cout << A[i] << endl;
    else
      cout << A[i] << ' ';
}

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

//0018
int main(){
	int x;
	vector<int> vec;
	vector<int>::iterator ite;
	for(int i=0; i<5; ++i){
		cin >> x;
		vec.push_back(x);
	}

	sort(vec.begin(), vec.end(), greater<int>());
	for(ite=vec.begin(); ite!=vec.end(); ite++){
		if(ite!=vec.begin()){
			cout << " ";
		}
		cout << *ite;
	}
	cout << endl;

	return 0;
}

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

int number[5];

void bubble(){
	for(int i = 0; i < 4; i++){
		for(int j = i + 1; j < 5; j++){
			if(number[i] < number[j])	swap(number[i], number[j]);
		}
	}
}

int main(void){
	for(int i = 0; i < 5; i++){
		cin >> number[i];
	}
	bubble();
	for(int i = 0; i < 5; i++){
		cout << number[i];
		if(i != 4)	cout << " ";
	}
	cout << endl;
  return 0;
}