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>


void swap(int &a, int &b)
{
	int c = a;
	a = b; b = c;
	return;
}

int main(void)
{
	int n[5]={0,0,0,0,0};
	for(int i=0; i < 5; i++){
		std::cin >> n[i];
		for(int j=0; i-j > 0; j++)
			if(n[i-j] > n[i-j-1])
				swap(n[i-j] , n[i-j-1]);
	}
	std::cout << n[0] << " ";
	std::cout << n[1] << " ";
	std::cout << n[2] << " ";
	std::cout << n[3] << " ";
	std::cout << n[4] << std::endl;
	return 0;
}

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

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

C++: #include<iostream>
using namespace std;
int main(){
  int a[10]={},b=0;
  for(int i=0;i<5;i++)
    cin>>a[i];
  for(int j=0;j<5;j++)
    for(int i=1;i<5;i++)
      if(a[i-1]<a[i]) swap(a[i-1],a[i]);

  for(int i=0;i<5;i++)
    cout<<a[i]<<' ';
  cout<endl;
  return 0;
}

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

using namespace std;

int main() {
	vector<int> num(5);
	cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];
	sort(num.begin(), num.end());
	reverse(num.begin(), num.end());
	printf("%d %d %d %d %d\n", num[0],num[1],num[2],num[3],num[4]);
	return 0;
}

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

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

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

  sort( num , num+5 );

  for( int i = 4 ; i >= 0 ; i-- ){
    if( i == 4 ) cout << num[i];
    else cout << " " << num[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 < 5; z++)
            {
                if(Number[z] < Number[z+1])
                {
                    Temp = Number[z+1];
                    Number[z+1] = Number[z];
                    Number[z] = Temp;
                }
            }
        }

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

    }
    return 0;

}

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

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<5;i++)
    cout<<a[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);
	reverse(t,t+5);
	cout<<a[0];
	for(int j=1;j<=5;j++){
		cout<<" "<<a[j];
	    }
	cout<<endl;
	return 0;
	}

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

using namespace std;

void Sort()
{
    int a[5];
    
    cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
        
    sort (a, a + 5, greater<int>()); //sorting from big int
        
    for(int i = 0; i < 4; i++)
    {
        cout<<a[i]<<" ";
    }
    
    cout<<a[4]<<endl;  //don't forget this part
    
    return;
}

int main()
{
    Sort();
    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[0],a[1],a[2],a[3],a[4]);
	
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void){
    double m[5];
    
    for(int i=0; i<5; i++){
        cin >> m[i];
    }
    sort(m, m+5);
    for(int i=4; i>=0; i--){
        cout << m[i];
        if(i!=0) cout << " " ;
    }
    cout << "\n";
    
    return 0;
}

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

int comp(const void *a,const void *b){
 int p=*(int*)a;
 int q=*(int*)b;
 return q-p;
}

int main(){
 int a[5];
 scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
 qsort(a,5,sizeof(int),comp);
 printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
 return 0;
}

C++: #include<iostream>
#include<cmath>
#include<cstdio>
#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<iostream>
#include<vector>
#include<algorithm>
#include<functional>
int main(){
	std::vector<int> a(5);
	for(int i=0;i<5;i++)std::cin>>a[i];
	sort(a.begin(),a.end(),std::greater<int>());
	for(int i=0;i<5;i++)std::cout<<a[i]<<std::endl;
	return 0;
}

C++: #include <stdio.h>
void qsort(int a[],int left,int right)
{
	if(left < right)
	{
		int pvot,tmp,i,j;
		i = left;
		j = right;
		pvot = (a[i] + a[j])/2;
		while(1)
		{
			while(a[i] < pvot)i++;
			while(a[j] > pvot)j--;
			if(i >= j)
			{
				break;
			}
			tmp = a[i];
			a[i] = a[j];
			a[j] = tmp;
			i++;
			j--;
		}
		qsort(a,left,i -1);
		qsort(a,j + 1,right);
	}
	return;
}
int main(void)
{
	int i,n;
	int array[5];
	for(i = 0;i < 5;i++)
	{
		scanf("%d",&array[i]);
	}
	qsort(array,0,4);
	for(i = 0;i < 4;i++)
	{
		printf("%d ",array[4-i]);
	}
	printf("%d\n",array[0]);
	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 = 0;i < 4;i++)cout << a[i] << " ";
	cout << a[4] << endl;
	return 0; 
}

C++: //
//  main.cpp
//  algorithm-practice1
//
//  Created by g-2018 on 2017/04/28.
//  Copyright ?? 2017??´ 3431. All rights reserved.
//

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
  //****??´??????
  //**** int a????????£?¨?
  int a[5];
  for(int i=0;i<5;i++){
    cin >> a[i];
    }
  //?????????
  sort(a,a+4);
  
  for(int i=4; i >= 0; i--){
    if( i != 4 ){
      cout << " ";
        }
    //**** ????????????
    cout << a[i];
  }
  cout << endl;
}

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

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

int a[5];

int main(){
	REP(i,5){
		cin>>a[i];
	}
	sort(a,a+5);
	REP(i,5){
		if (i) cout<<" ";
		cout<<a[4-i];
	}
	cout<<endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
void swap(int *x, int *y)
{
	int tmp = *x;
	*x = *y;
	*y = tmp;
}

void sort(int date[], int n)
{
	int k = n-1;
	while(k>=0){
		int i,j;
		for (i=1, j=-1; i <=k; i++)
			if(date[i-1] < date[i]) {
				j = i-1;
				swap(&date[i], &date[j]);
			}
		k = j;
	}
}

int main(void)
{
	int n[5];
	while(cin >> n[0]){
		for(int i = 1; i < 5; i++){
			cin >> n[i];
		}
		sort(n, 5);
		for(int i=0; i<5; i++){
			cout << n[i];
			if(i!=5) cout << " "; 
		}
		cout << endl;
	}
	return(0);
}

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

int main(int argc, const char * argv[])
{
    int data[5];
    for (int i = 0; i < 5; i++) {
        cin >> data[i];
    }
    sort(&data[0],&data[5]);
    for (int i = 4; 0 <= i; i--) {
        cout << data[i];
        (i != 0)? cout << " ": cout << endl;
    }
    return 0;
}

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

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