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>
#include <functional>

using namespace std;

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

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#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 FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

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

int main(){
	ios::sync_with_stdio(false);

	vi a(5, 0);

	REP(i, 5)	scanf("%d", &a[i]);

	VSORT(a);

	REPR(i, 4)	printf("%d ", a[i]);

	printf("\n");
}

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


int main()
{
    int arr[5], t;
    for (int i = 0; i < 5; i++) {
        scanf("%d", &t); arr[i] = t * -1;
    }
    sort(arr, arr+5);
    for (int i = 0; i < 5; i++) {
        if (i) printf(" ");
        printf("%d", arr[i]*-1);
    }
    printf("\n");

    return 0;
}

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

int main(){
    int arr[5];

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

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

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

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

using namespace std;

int number;

int main(){
	vector<int> v;
 
	for(int i=0;i<5;i++){
		cin >> number;
		v.push_back(number);
	}

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

	for(int i=0;i<5;i++){
		if(i<4){
			printf("%d ",v[i]);
		}else{
			printf("%d\n",v[i]);
		}
	}
}

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

using namespace std;

int line[5];

int main()
{
	for(int i=0;i<5;i++)scanf("%d",&line[i]);
	sort(line,line+5);
	for(int i=0;i<5;i++)
	{
		printf("%d",line[i]);
		if(i!=5)printf(" ");
	}
	printf("\n");
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;


int main(void){

	vector< int > v( 5, 0 );

	for( int i = 0; i < 5; i++ )
		cin >> v[i];

	sort( v.begin(), v.end() );
	
	cout << v[4];
	for( int i = 3; i >= 0; i-- )
		cout << " " << v[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);
	
	for(int i=4;i>0;i--)
	cout << A[i] << " ";
	cout << A[0] << "\n";
	
    return 0;
}

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

#define EPS (1e-10)
using namespace std;
#define PI (3.1415926535)

int main(){
	vector<int> a(5);
	bool f = true;

	for(int i = 0; i < 5; i++){
		cin >> a[i];
	}
	sort(a.begin(), a.end());

	for(int i = 0; i < 5; i++){
		if(!f){
			cout << ' ';
		}
		cout << a[4-i];
		f = false;
	}
	cout << endl;


	return 0;
}

C++: #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);
printf("%d %d %d %d %d\n",a[4],a[3],a[2],a[1],a[0]);
return 0;
}

C++: #include<stdio.h>
int main()
{
    int a[5];
    for(int i=0;i<5;i++)
        scanf("%d",&a[i]);
    for(int i=0;i<5;i++)
        for(int j=0;j<4-i;j++)
        {
            int temp=a[j+1];
            if(a[j]<a[j+1])
                {
                    a[j+1]=a[j];
                    a[j]=temp;

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

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

using namespace std;

int main() {

	int i, j;
	deque <int> n;

	for(i=0; i<5; i++) {
		cin >> j;
		n.push_back(j);
	}

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

	for(i=4; i>0; i--) {
		cout << n[i] << " ";
	}

	cout << n[i] << endl;

	return 0;

}

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

C++: #include <stdio.h>

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

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

using namespace std;

int main() {
    vector<int> a(5);
    for (size_t i=0; i<5; ++i)
        scanf("%d", &a[i]);

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

    for (size_t i=0; i<5; ++i)
        printf("%d%c", a[i], i<4? ' ':'\n');

    return 0;
}

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

using namespace std;

int main(void)
{
	int a,b,c,d,e;
	while(cin>>a>>b>>c>>d>>e)
	{
		deque<int> nums;
		nums.push_back(a);
		nums.push_back(b);
		nums.push_back(c);
		nums.push_back(d);
		nums.push_back(e);
		sort( nums.begin(), nums.end(), greater<int>() );
		deque<int>::iterator it = nums.begin();
		while( it != nums.end() )
		{
			cout<<*it<<" ";
			++it;
		}
		nums.clear;
		cout<<endl;
	}
	return 0;
}

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

using namespace std;

int main() {

	int a[5];
	int kari;

	cin >> a[0] >> a[1] >> a[2] >> a[3] >> a[4];

	for (int j = 4; j > 0; j--) {
		for (int i = 0; i < j; i++) {
			if(a[i] < a[i+1]) {
				kari = a[i];
				a[i] = a[i+1];
				a[i+1] = kari;
			}
		}
	}

	cout << a[0];

	for (int i = 1; i < 5; i++) {
		cout << " " << a[i] ;
	}

	cout << endl;

	return 0;
}

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

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);
  cout <<num[0]<<" "<<num[1]<<" "<<num[2]<<" "<<num[3]<<" "<<num[4]<<endl;
  return 0;
}