Go: package main

import (
        "fmt"
        "sort"
)


func main() {
        var s []int
        var n int
        for i := 0; i < 5; i++ {
                fmt.Scanf("%d", &n)
                s = append(s, n)
        }
        sort.Ints(s)
        for i:= 1; i <= len(s); i++ {
                fmt.Printf("%d", s[len(s)-i])
                if i < len(s) {
                        fmt.Printf(" ")
                }
        }
        fmt.Printf("\n")
}

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

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

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑


int main() {
	vector<int>v;
	for (int i = 0; i < 5; ++i) {
		int n;
		cin >> n;
		v.push_back(n);
	}
	sort(v.rbegin(), v.rend());
	for (auto i : v) { cout << i << " "; }
}

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

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

	std::cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];

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

	for(size_t i=0; i<num.size()-1; ++i)
	{
		std::cout << num[num.size()-1-i] << ' ';
	}

	std::cout << num[0] << '\n';
}

C++: #include <cstdio>
#include <algorithm>
#include <functional>
#include <stack>
#include <cmath>
using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define llong long long

int main() {
  int a[5];
  REP(i,5) scanf("%d",a+i);
  sort(a,a+5,greater<int>());
  REP(i,4) printf("%d ",a[i]);
  printf("%d\n",a[4]);
  return 0;
}