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>

int main()
{
    std::vector<int> Numbers;
    for(std::size_t i = 0; i < 5; ++i){
        int n;
        std::cin >> n;
        Numbers.push_back(n);
    }
    std::sort(Numbers.begin(), Numbers.end(), std::greater<int>());
    for(std::size_t i = 0; i < Numbers.size(); ++i){
        if(i) std::cout << " ";
        std::cout << Numbers[i];
    }
    return 0;
}

C++: 
//  test.cpp

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>

using namespace std;


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

    
    
    return 0;
}

C++: #include <cstdio>
#include <algorithm>
#define SWAP(a,b) { a += b, b = a - b, a -= b; }
using namespace std;

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
long 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 <vector>
#include <algorithm>
#include <stack>
#include <string>
#include <map>
#include <functional>
#include <cmath>
#include <cstdio>
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++){
    cout << a[i];
    if(i != 4)cout << " ";
  }
  cout << endl;
}

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

int main(){
	vector<int> a(5);
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
	sort(a.begin(),a.end());
	
	cout<<a[4]<<" "<<a[3]<<" "<<a[2]<<" "<<a[1]<<" "<<a[0]<<endl;
	return 0;
}

C++: #include <iostream> 
#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);
	for(int i=4;i>=0;i--)
		printf("%d%c",a[i],i==0?'\n':' ');
    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(a, a+5);
	for(int i = 0;i < 4;i++)cout << a[i] << " ";
	cout << a[4] << endl;
	return 0; 
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	vector<int>in(5);
	rep(i,5)cin>>in[i];
	sort(all(in));
	rep(i,5){
		if(i)cout<<' ';
		cout<<in[4-i];
	}
	cout<<endl;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int num[5];

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

  sort(num, num + 5, greater<int>());

  for(int i = 0; i < 5; i++)
    cout << num[i] << ((i!=4)?'':'\n');

}

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

int main(){

int a,b,c,d,e;
cin >> a >> b >> c >> d >> e;
int r = 0;
if(a < b){
r = a;
a = b;
b = r;
}
if(a < c){
r = a;
a = c;
c = r;
}
if(a < d){
r = a;
a = d;
d = r;
}
if(a < e){
r = a;
a = e;
e = r;
}

if(b < c){
r = b;
b = c;
c = r;
}
if(b < d){
r = b;
b = d;
d = r;
}
if(b < e){
r = b;
b = e;
e = r;
}
if(c < d){
r = c;
c = d;
d = r;
}
if(c < e){
r = c;
c = e;
e = r;
}
if(d < e){
r = d;
d = e;
e = r;
} 
cout >> a >> b >> c >> d >> e >> endl;
    return 0;
}

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

#define FOR(var, start, end)    for(var = start; var < end; ++var)
#define WHILE(var, end)  while(var != end)
#define SHOW_ALL(a, b, c)    cout << a << endl; \
                                cout << b << endl; \
                                cout << c << endl;

using namespace std;


void BubbleSort(vector <int> &num)
{
      int i, j, flag = 1;    // set flag to 1 to start first pass
      int temp;             // holding variable
      int numLength = num.size( ); 
      for(i = 1; (i <= numLength) && flag; i++)
     {
          flag = 0;
          for (j=0; j < (numLength -1); j++)
         {
               if (num[j+1] > num[j])      // ascending order simply changes to <
              { 
                    temp = num[j];             // swap elements
                    num[j] = num[j+1];
                    num[j+1] = temp;
                    flag = 1;               // indicates that a swap occurred.
               }
          }
     }
     return;   //arrays are passed to functions by address; nothing is returned
}

int main()
{
    int input;
    vector<int> input_array;
    while(cin >> input){
        input_array.push_back(input);
    }
    BubbleSort(input_array);
    for(auto num:input_array){
        cout << num ;
    }
    
}

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

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
	int a[5];
	REP(i, 5) cin >> a[i];
	sort(a, a+5, greater<int>());
	REP(i, 5) {
		cout << a[i];
		if(i != 4) cout << " ";
	}
	cout << endl;

	return 0;
}

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

using namespace std;

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

C++: #include <iostream>

int main(){
	
	int a[5];
	int s[5];
	for(int r=0;r<5;r++){
		s[r]=-100000;
	}
	for(int b=0;b<5;b++){
		std::cin>>a[b];
		if(a[b]>s[0]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=s[0];
			s[0]=a[b];
		}else if(a[b]>s[1]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=s[1];
			s[1]=a[b];
		}else if(a[b]>s[2]){
			s[4]=s[3];
			s[3]=s[2];
			s[2]=a[b];
		}else if(a[b]>s[3]){
			s[4]=s[3];
			s[3]=a[b];
		}else{
			s[4]=a[b];
		}
	}
	for(int q=0;q<5;q++){
		std::cout<<s[q];
		if(q!=4){
			std::cout<<" ";
		}
	}
	std::cout<<std::endl;
	return 0;
}