Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"sort"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	scanner.Split(bufio.ScanWords)
	nums := make([]int, 5)
	for i := 0; i < 5; i++ {
		nums[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(nums)))
	for i, v := range nums {
		if i == len(nums)-1 {
			fmt.Printf("%d\n", v)
		} else {
			fmt.Printf("%d ", v)
		}
	}
}

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);
    }
    sort(vc.begin(),vc.end());
    for(int i=0;i<vc.size();i++){
        cout << vc[i] << " ";
    }
    cout << 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, greater<int>());
	for( int i = 0; i < 4; i++ ) {
		cout << a[i] << " ";
	}
	cout << a[4] << endl;
	return 0;
}

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

int main(){
	vector<int> v(5);
	for(int i = 0; i < 5; i++){
		scanf("%d",&v[i]);
	}
	sort(v.rbegin(), v.rend());
	for(int i = 0; i < 5; i++){
		printf("%d ", v[i]);
	}
	printf("\n");
	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[11],date[11];
	for (int i = 1; i <= 5; i++) {
		cin >> a[i];
	}
	int dai = -999999;
	int o;
	for (int i = 1; i <= 5; i++) {
		int dai = -999999;
		for (int z = 1; z <= 5; z++) {
			if (dai <= a[z]) {
				dai = a[z];
				o = z;
			}
		}
		date[i] = dai;
		a[o] = -9999999;
	}
	for (int i = 1; i <= 4; i++) {
		cout << date[i]<<" ";
	}
	cout << date[5] << endl;;
}

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

int main(){
  int num[5];
  for(int i = 0;i < 5;i++){
    scanf("%d", num + i);
  }
  sort(num, num + 5);
  for(int i = 4;i >= 0;i--){
    if(i != 4)putchar(' ');
    printf("%d", num[i]);
  }
  puts("");
  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);
	reverse(a, a + 5);
	
	for (int i = 0; i < 5; i++){
		printf("%d", a[i]);
		if (i < 4){
			printf(" ");
		}
	}
	printf("\n");
	
	return (0);
}

C++: #include<stdio.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include<math.h>
#include <algorithm>
using namespace std;



int main(void)
{
  int e,f=0;
  int i=0,j,k,l;
  double Max,Min,ans;
  vector<int> array;
  int aiTable[5];

cin>>aiTable[0]>>aiTable[1]>>aiTable[2]>>aiTable[3]>>aiTable[4];
    
 sort(aiTable, aiTable + 5);

for(i=5;i>0;)
    {
		i--;
	cout<<aiTable[i]<<" ";
    }
cout<<endl;
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <functional>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;

int main()
{
	int a[5];
	while(1){
		rep(i, 5){
			if(scanf("%d", &a[i]) == EOF)
				return 0;
		}
		sort(a, a+5, greater<int>());
		rep(i, 5){
			printf("%d", a[i]);
			if(i<4) printf(" ");
		}

		puts("");
	}
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<string.h>
#include<functional>
#include<queue>
#include<stack>
#include<math.h>
#define INF 999999
#define EPS 1.0e-6

using namespace std;

typedef long long ll;

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

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

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

int main() {
    int numbers[5];
    int x;
    for (int i=0; i<5; i++) {
        cin >> x;
        numbers[i] = x;
    }
    for (int i=0; i<5; i++){
        for (int j=i; j<5; j++){
            if (numbers[j] > numbers[i]){
                int temp = numbers[j];
                numbers[j] = numbers[i];
                numbers[i] = temp;
            }
        }
        cout << numbers[i] << ' ';
    }
    return 0;
}

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

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

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

int main() {
vector<int> numbers(5);
REP(i, 5){
	cin >> numbers[i];
}
RSORT(numbers);
cout << numbers[0] << " " << numbers[1] << " " << numbers[2] << " " << numbers[3] << " " << numbers[4] << endl;
}

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;

/**
 * vector<int>ar(3);
 * for(auto&e:ar){
 *     scanf("%d",&e);
 * }
 * sort(ar.begin(),ar.end())
 * int sum=accumulate(ar.begin(),ar.end(),0);
 **/

int main(){
    int mod=1000000007;
    vector<int> a(5);
    for(auto&e:a) {
        scanf("%d",&e);
    }
    sort(a.begin(),a.end());
    for(int i=4;i>0;i--) {
        printf("%d ",a[i]);
    }
    printf("%d\n",a[0]);
    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 <fstream>
#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
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] << " ";
  cout << a[0] << endl;
}

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

int main(){
	int a[5],i;
	for(i=0;i<5;i++){
		cin >> a[i];
	}
  sort(a,a+5,greater<int>()); 
	for(i=0;i<5;i++){
		cout << a[i];
		if(i<3)cout << ' ';
		else cout << 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 j = 4; j > -1; j--) {
		cout << a[j];
		if (j != 0) {
			cout << " ";
		}
		else {
			cout << endl;
		}
	}
	getchar();
	getchar();
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int a[5];

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


	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
double a[5];

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


	return 0;
}