Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <functional>
using namespace std;

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

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

using namespace std;

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

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

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

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

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

    }
    return 0;

}

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

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

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <deque>
#include <list>
#include <string>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>

using namespace std;

int input;
vector<int> nums;

int main() {
	for (int i = 0; i < 5; i++) {
		cin >> input;
		nums.push_back(input);
	}

	sort(nums.begin(), nums.end());
	reverse(nums.begin(), nums.end());

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

	return 0;
}

/*@@@@@@@@@@@@@@@@@@@@@@@@@*/
/*@                       @*/
/*@ debug output erased ? @*/
/*@                       @*/
/*@@@@@@@@@@@@@@@@@@@@@@@@@*/

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

using namespace std;

int main()
{
	int i;
	int num[5];
	
	for(i = 0; i < 5; i++)
	{
		cin >> num[i];
	}
	
	sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 5; i++)
	{
		cout << num[i] << " " ;
	}
	
	cout << endl;
	
	
	return 0;
	
}

C++: #include<iostream>
#include<algorithm>
#define FOR(i,n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
  int num[5];
  FOR(i,5) cin >> num[i];
  sort(num,num+5);
  FOR(i,5) cout >> num[i];
}

C++: #include<iostream>
#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);
	cout << a[4] <<" "<< a[3] <<" "<< a[2] <<" "<< a[1] <<" "<< a[0]<<endl;
	return 0;
}

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

int Array[5];
int tmp;

int main() {
	for (int i = 0; i < 5; i++)
	{
		cin >> Array[i];
	}
	
	for (int i = 0; i < 5 - 1; i++){
		for (int g = i+1; g < 5; g++){
			if (Array[i]<Array[g]){
				tmp = Array[i];
				Array[i] = Array[g];
				Array[g] = tmp;
			}
		}
	}

	cout << Array[0] << " " << Array[1] << " " << Array[2] << " " << Array[3] << " " << Array[4] << endl;

	return 0;
}

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

using namespace std;

int main(){
  int a[5],i,j,min,min_n;

  for(i=0:i<5;i++)
    scanf("%d",&a[i]);

  for(i=0;i<5;i++){
    min=a[i]; min_n=i;
    for(j=i+1;j<5;j++){
      if(min>a[j]){
        min=a[j]; min_n=j;
      }
    }
  swap(a[i],a[min]);
  printf( i<4 ? "%d " : "%d\n",a[i]);
  }
  return 0;
}

C++: #include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<string>
using namespace std;
int temp[5];
bool compare(int a,int b)
{
    return a>b;
}
int main()
{
  //  freopen("test.txt", "r", stdin);
  //  freopen("testout.txt", "w", stdout);
    while(~scanf("%d",&temp[0]))
    {
        for(int i=1;i<5;i++)
            cin>>temp[i];
        sort(temp,temp+5,compare);
        for(int i=0;i<4;i++)
        {
            cout<<temp[i]<<' ';
        }
        cout<<temp[4]<<endl;
    }
    return 0;
}

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

int main(){
int a;
int b[5];
int c;
int d;
int e;
c=0;
while(c<5){
b[c]=0;
c=c+1;
}
c=0;
while(c<5){
cin >>a;
d=0;
while(1){if(a>=b[d]){e=3; if(e>=d){while(e>=d){b[e+1]=b[e]; e=e-1;}} b[d]=a; break;} d=d+1;     }
c=c+1;
}
c=0;
while(c<5){
cout << b[c] <<" ";
c=c+1;}



}

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

int main(void)
{
	int num;
	vector<int> nums;
	for(int f1 = 0; f1 < 5; f1++)
	{
		scanf("%d", &num);
		nums.push_back(num);
	}
	sort(nums.begin(), nums.end(), greater<int>());
	vector<int>::iterator t = nums.begin();
	for(int f1 = 0; f1 < 5; f1++)
	{	
		if(f1 + 1 < 5)
		{
			printf("%d ",*(t + f1));
		}
		else
		{
			printf("%d\n",*(t + f1));
		}
	}
	return 0;
}

C++: #include<stdio.h>

int main(void)
{
	int a,b,c,d,e,x[5],t=0;
	scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);

	for(t;t<5;t++)
	if(a>=b&&a>=c&&a>=d&&a>=e)
	{
		x[t]=a;
		a=-1;
	}
	else if(b>=c&&b>=d&&b>=e)
	{
		x[t]=b;
		b=-1;
	}
	else if(c>=d&&c>=e)
	{
		x[t]=c;
		c=-1;
	}
	else if(d>=e)
	{
		x[t]=d;
		d=-1;
	}
	else
	{
		x[t]=e;
		e=-1;
	}

	printf("%d %d %d %d %d",x[0],x[1],x[2],x[3],x[4]);
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <set>

using namespace std;

int main()
{
	multiset<int, greater<int> > n;
	multiset<int>::iterator ite;
	int a;

	for(int i=0; i<5; i++){
		cin >> a;
		n.insert(a);
	}
	int i=0;
	for(ite=n.begin(); i<5; ite++, i++){
		if(i==4){ cout << *ite << endl;}
		else{cout << *ite << " ";}
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int n[5];
  for(int i=0;i<5;i++) cin >> n[i];
  sort(n,n+5greater<int>());
  for(int i=0;i<5;i++){
    if(i!=4) cout << n[i] << ' ';
    else cout << n[i] << endl;
  }
  return 0;
}

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

int main(void)
{
	int d[5];

	for(int i = 0; i < 5; i++)
		cin >> d[i];
	sort(d,d+5);
	for(int i = 4; i >= 0; i--)
		cout << d[i] << endl;


	return 0;
}

C++: 
 #include <string>
 #include <vector>
 #include <algorithm>
 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <queue>
 #include <map>
 #define INF 100000000
 
 using namespace std;
 typedef long long ll;
 
 int main(){
 vector<int> a;
 for(int i=0;i<5;i++){
 int tmp;
 cin>>tmp;
 a.push_back(tmp);
 }
 sort(a.begin(),a.end());
 for(int i=4;i>=0;i--){cout<<a[i];if(i!=0)cout<<" ";}
 cout<<endl;
 return 0;
 }

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
int a[5];
for( int s = 0; s < 5; s++){
cin >> a[s]
}
sort( a, a + 5, greater<int>());
for(int i = 0; i < 5; i++){
 cout << a[i] << " ";
}
cout << endl;
return 0;
}