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 <vector>
#include <algorithm>
using namespace std;
 
int main(){
	vector<int> a(5);
	for(int i=0; i<5; i++){
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	for(int i=4; i>0; i--){
		cout << a[i] << " ";
	}
	cout << a[0] << endl;
	return 0;
}

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

using namespace std;
int main()
{
	int i, j;
	int num[5];
	
	for(i = 0; i < 5; i++)
	{
		cin >> num[i];
	}
	
	stable_sort(num, num + 5, greater<int>());
	
	for(i = 0; i < 4; i++)
	{
		cout << num[i] << " ";
	}
		
		cout << num[4] << endl;
	
	return 0;
}

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

#define INF_MAX 	2147483647
#define INF_MIN 	-2147483648
#define INF 		(1 << 30)
#define SORT(a,n)   sort(a,a+n)
#define EPS			1e-9
#define PI 			acos(-1.0)
#define N 		    2 + 100
#define MOD			10000000007
#define sz(x) 		(int)(x).size()
#define all(x) 		(x).begin(), (x).end()
#define pb 			push_back
#define mp			make_pair
#define ms(x, a) 	memset((x), (a), sizeof(x))
#define ff           first
#define ss           second
#define rep(i,a,b)  for(int i=(a); i<(b); i++)
#define repC(i,x) 	for(size_t i=0; i<x.size(); i++)
#define repIT(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define nn          '\n'
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define i64 __int64
#define isValid(x, y) ( x >= 0 And x < row And y >= 0 And y < col )
#define dump cin.ignore()


typedef long long 		LL;
typedef pair<int,int> 	pii;
typedef vector<int> 	vi;
typedef vector<string> 	vs;
typedef vector<char>	vc;
typedef vector<bool>    vb;
typedef vector< pii >   vii;
typedef map<string,int> msi;
typedef map<int,int>	mii;
typedef map<char,int>   mci;
typedef map<int,string>	mis;

template<class T> T Abs(T x) {return x>0 ? x : -x;}
template<class T> T Max(T a, T b) {return a>b ? a : b;}
template<class T> T Min(T a, T b) {return a<b ? a : b;}
template<class T> T gcd(T a, T b) {return (b ? gcd(b,a%b) : a);}
template< class T > T sq(T x){ return x * x;}
template< class T > T lcm(T a, T b){ return (a / gcd<T>(a, b) * b); }
template< class T > T deb(T cmd) {cout << "debugger:" << endl; cout << cmd << endl;}
template< class T > T deb(T cmd1, T cmd2) {cout << "debugger:" << endl; cout << cmd1 << "\t" << cmd2 << endl;}
template< class T > T deb(T cmd1, T cmd2, T cmd3) {cout << "debugger:" << endl; cout << cmd1 << "\t" << cmd2 << "\t" << cmd3 << endl;}
template< class T > T deb(T cmd1, T cmd2, T cmd3, T cmd4) {cout << "debugger:" << endl; cout << cmd1 << "\t" << cmd2 << "\t" << cmd3 <<"\t" << cmd4 << endl;}
bool isVowel(char ch){ch=tolower(ch);return(ch=='a' || ch=='e' || ch=='i' || ch=='o' || ch=='u');}

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

#define MAX 10000

int main()
{
	#ifndef ONLINE_JUDGE
		//freopen("in.txt", "r", stdin);
	#endif

    vi v; int num;

    rep(i, 0, 5) cin >> num, v.pb(num);
    sort(v.rbegin(), v.rend());
    repC(i, v)
    {
        if(i) cout << " ";
        cout << v[i];
    }
    cout << endl;

  return 0;
}

/*

3 6 9 7 5

*/

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

int main(void){
  int arr[5];
  for(int i=0; i<5; i++){
    cin >> arr[i];
  }
  sort(arr,arr+5);
  for(int i=0; i<5; i++){
    cout << arr[4-i];
    cout << (i == 4 ? '\n' : ' ');
  }
  return 0;
}

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

int main(){
  int a[5];
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=0;i<4;i++)
      if(a[i]<a[i+1]) swap(a[i],a[i+1]);
  for(int i=0;i<4;i++)
    cout<<a[i]<<' ';
  cout<<a[4]<<endl;
  return 0;
}

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

for(int i=0;i<5;i++)
{if(i>0)printf(" ");
printf("%d",n[i]);}
return 0;
}

C++: #include<iostream>
#include<algorithm>
int main(){
	int a[5];
	for(int i=0;i<5;++i){
		std::cin>>a[i];
	}
	std::sort(a,a+5);
	for(int i=4;i>=0;--i){
		std::cout<<a[i]<<' ';
	}
	return 0;
}

C++: #include<iostream>

int main(){
   int i[5],a,b,n;
   for(a=0;a<5;++a){
    std::cin>>i[a];
    }
    for(a=0;a<4;++a){
        for(b=a+1;b<5;++b){
        if(i[a]<i[b]){
        n=i[a];
        i[a]=i[b];
        i[b]=n;
        }
        }
  }
  
      for(a=0;a<5;++a){
      std::cout<<i[a]<<" ";
      }
    return 0;
    }

C++: #include <stdio.h>

int main(void) {
	int num[5];
	int tmp;
	char buf[256];
	
	fgets(buf, sizeof(buf), stdin);
	sscanf(buf, "%d %d %d %d %d", &num[0], &num[1], &num[2], &num[3], &num[4]);
	
	for (int i=0; i<5-1; i++) {
		for (int j=i+1; j<5; j++) {
			if (num[i] < num[j]) {
				tmp = num[i];
				num[i] = num[j];
				num[j] = tmp;
			}
		}
	}
	
	printf("%d %d %d %d %d\n", num[0], num[1], num[2], num[3], num[4]);
	
	return 0;
}

C++: #include <stdio.h>
    void main ()
    {

        int number[5];
        int i,j,a,n;
        for (i =0;i<5;++i)
	        scanf("%d",&number[i]);

        for (i=0; i<3;++i)
        { for (j=i+1; j<4;++j)
            {
                if (number[i]<number[j])
                {
                    a=number[i];
                    number[i]=number[j];
                    number[j]=a;
                }
            }
        }

        for(i= 0;i<6;++i)
        {
            printf("%d ", number[i]);
        }
    }

C++: #include <iostream>
#include <cstdio>
#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<string>
#include<vector>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<sstream>
#include<functional>
#include<map>
#include<stack>
#include<set>
#include<cmath>

#define REP(i,s,e) for(int i=int(s);i<=int(e);i++)
#define rep(i,n) for(int i=0;i<int(n);i++)

#define EPS 1e-6

using namespace std;


int main(){

vector<int>v;
int a;

rep(i,5){

cin >> a;
v.push_back(a);

}

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

rep(i,5) cout << v[i] << " ";

cout << endl;


	return 0;
}

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

using namespace std;

int main(){
  vector<int> hoge;
  for(int i=0; i<5; i++){
    int n;
    scanf("%d",&n);
    hoge.push_back(n);
  }

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

  for(int i=0; i<5; i++){
    printf("%d",hoge[4-i]);
    if(i!=4)
      putchar(' ');
  }
  putchar('\n');
}

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] << ' ';
	cout << endl;


	return 0;
}