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 "bits/stdc++.h"

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	auto V=vecin(5);
	sort(ALL(V),greater<int>());

	REP(i,4){
		cout << V[i] << ' ';
	}
	out(V[4]);
	return 0;
}

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

using namespace std;
int main(void)
{
	int a[5];
	for(int i = 0;i<5;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a,a+5);
	reverse(a,a+5);
		for(int i = 0;i < 5;i++)
		{
			printf("%d",a[i]);
			if(i <= 3) printf(" ");
		}



	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#define pi 3.14159
using namespace std;


int main() {
	int a[5], temp;
	for (int i = 0; i < 5; i++) cin >> a[i];
	for (int i = 0; i < 5; i++) {
		for(int j = 0; j < 5 - i; j++) {
			if(a[i] > a[j]) {
				temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			}
		}
	}
	for (int i = 0; i < 5; i++) cin >> a[i];
	

	return 0;
}

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

int main(){
	vector<int> a;
	int n;

	for(int i=0 ; i<5 ; i++){
		cin >> n;
		a.push_back(n);
	}
	sort( a.begin() , a.end() );
	for(int i=4 ; i>=0 ; i--){
		cout << a[i] ;
		(i==0)? cout << endl : cout << " ";
	}
}

C++: #include <iostream>
#include <algorithm>
int main()
{
  int n[5] = {};
  std::cin >> n[0] >> n[1] >> n[2] >> n[3] >> n[4];
  std::sort(std::begin(n), std::end(n), [](int a, int b){return a > b;}) ;
  std::cout << n[0] << " " << n[1] << " " << n[2] << " " << n[3] << " " << n[4] << std::endl;
  return 0;
}

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

C++: #include <iostream>
#include <math.h>
#define PI 3.141592
using namespace std;

int main() {
int a[5];
cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
for(int k=0;k<=3;k++){
	for(int l=k+1;l<=4;l++){
		if(a[k]<a[l]){
			int c;
		c=a[k];
		a[k]=a[l];
		a[l]=c;
	}
}
}
cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<endl;
	return 0;
}

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

int main(void){


    vector<int> array(5,0);

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

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

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

    return 0;
}

C++: #include<iostream>
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<cstdio>
#include<string>
using namespace std;

void swap(int *x,int *y){

    int tmp;
    
    tmp=*x;
    *x=*y;
    *y=tmp;
    return;
}

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

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>

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

int main(){
	int n = 5;

	vector<int> aa;

	REP(i, n){
		int a;
		cin >> a;
		aa.push_back(a);
	}

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

	int i(0);
	for (auto x : aa){
		cout << x;
		if (i != 4){
			cout << " ";
		}
		++i;
	}
	cout << endl;

	return 0;
}

C++: #include<iostream>
#include<string>
#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--)(i==0)?cout<<a[i]<<endl:cout<<a[i]<<" ";
	return 0;
}

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

int main()
{
    std::array<int, 5> in;
    for (auto i = 0; i < 5; i++) {
        std::cin >> in.at(i);
    }

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

    for (auto i = 4; i >= 0; i--) {
        if (i != 4) {
            std::cout << " ";
        }
        std::cout << in.at(i);
    }
    std::cout << std::endl;

    return 0;
}

C++: #include<numeric>
#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,greater<int>());
	for(int i=0;i<5;i++)	cout<<(i?" ":"")<<a[i];
	cout<<endl;
	return 0;
}

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

C++: #define scanf_s scanf
//#define gets_s gets
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 81
#define _MAX 100
#define ABC 26
int main(void)
{
	int a[5],b;
	for (int i = 0; i < 5;++i){
		scanf_s("%d", &a[i]);
	}
	for (int i = 0; i < 5; ++i) {
		for (int j = 4; j > i; --j) {
			if (a[j] > a[j - 1]) {
				b = a[j - 1]; a[j - 1] = a[j]; a[j] = b;
			}
		}
	}
	for (int i = 0; i < 5; ++i) {
		if (i != 0)printf(" ");
		printf("%d", a[i]);
	}
}

C++: #include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
    int a[5];
    rep(i, 5) scanf("%d", a + i);
    rep(i, 5) rep(j, 5) if(a[i] > a[j]) std::swap(a[i], a[j]);
    rep(i, 5) printf("%d%c", a[i], i == 4 ? '\n' : ' ');
    return 0;
}

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


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

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


using namespace std;

int main() {
	
	vector<int> v;
	v.resize(5);
	for(int i = 0; i < 5; i++) {
		cin >> v[i];
	}
	
	sort(v.begin(), v.end(), greater<int>());
	
	for(int i = 0; i < 5; i++) {
		cout << v[i] << " ";
	}
	
	cout << endl;
	
	return 0;
}