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<stdio.h>
#include<stdlib.h>
int main(){
    int i,j,k,x=0,l,n=5,a[100]={0};
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(j=0;j<=10000;j++){
        for(k=0;k<n;k++){
            if(a[k]<a[k+1]){
                x=a[k];
                a[k]=a[k+1];
                a[k+1]=x;
            }
        }
    }
    for(l=0;l<n;l++)printf("%d ",a[l]);
    printf("\n");
    return 0;
}

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

int main()
{
	 string input;
 while(cin && getline(cin, input)){
  int a, b, c, d, e;
  istringstream is(input);
  is>>a>>b>>c>>d>>e;
  vector<int> buf;
  buf.push_back(a);
  buf.push_back(b);
  buf.push_back(c);
  buf.push_back(d);
  buf.push_back(e);
  sort(buf.begin(),buf.end());
  reverse(buf.begin(),buf.end());
  for(int i=0; i<buf.size(); i++){
   if(i!=0) cout<<" ";
   cout<<buf[i];
  }
  cout<<endl;
  break;
 }
}

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

int main()
{
	int n[5];
	int x=0;

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

	}
	for(int i=0 ;i<5 ;i++){
		for(int j=i+1 ;j<5 ;j++){
			if(n[i] < n[j]){
				x = n[i];
				n[i] = n[j];
				n[j] = x;
			}
		}
	}

	for(int i=0 ;i<5 ;i++)
		cout << n[i] << ' ';

	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] <<" ";
	}
	return 0;
}

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

using namespace std;

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

C++: #define _USE_MATH_DEFINES

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>

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


}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <queue>
#include <cmath>
#include <stack>

#define int64 long long int

using namespace std;

int main()
{
	int i, n;
	priority_queue<int> qu;

	for(i=0; i<5; i++) {
		cin >> n;
		qu.push(n);
	}
	for(i=0; i<5; i++) {
		cout << qu.top();
		qu.pop();
		if(i != 4) cout << ' ';
		else cout << '\n';
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
 #include<functional>

#define INPUT_FROM_FILE (0) 
#if INPUT_FROM_FILE
#include <fstream>
#endif

int main(int argc, char **argv){
	std::vector<int> v(5);

#if INPUT_FROM_FILE
	std::ifstream ifs("test.txt");
#endif

#if INPUT_FROM_FILE
	ifs >> v[0] >> v[1] >> v[2] >> v[3] >> v[4];
#else
	std::cin >> v[0] >> v[1] >> v[2] >> v[3] >> v[4];
#endif

	std::sort(v.begin(), v.end(), std::greater<int>());
	
	std::cout << v[0];
	for(int i = 1; i < 5; i++){
		std::cout << " " << v[i];
	}
	std::cout << std::endl;
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int a[5],i,j,b;
	scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
	for(i=0;i<5;i++){
		for(j=0;j<4;j++){
			if(a[j]<=a[j+1]){
				b=a[j];
				a[j]=a[j+1];
				a[j+1]=b;
			}
		}
	}
	for(i=0;i<5;i++){
		printf("%d",a[i]);
		if(i<4){
			printf(" ");
		}else{
			printf("\n");
		}
	}
	return 0;
}

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

int main(){
int a[5];
int biggest[5];
cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
biggest[0]=a[0];
for(int i=1;i<5;i++){
for(int j=0;j<i;j++){
if(a[i]>biggest[j]){
for(int k=i;k>j;k--){
biggest[k]=biggest[k-1];}
biggest[j]=a[i];
break;}}}
for(int i=0;i<5;i++){
if(i!=4){
cout<<biggest[i]<<" ";}
if(i=4){
cout<<biggest[i];}
}}

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]);

	
}

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

int main(void){

  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];
    if( i != 0 )cout << " ";
  }
  cout << endl;
  return 0;
}

C++: # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <cmath>
# include <iomanip>
# include <functional>

using namespace std;

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

C++: #include <iostream>

int main(){
	
	int a[5];
	int s[5];
	for(int r=0;r<5;r++){
		s[r]=0;
	}
	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]<<" ";
	}
	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 <algorithm>
#include <vector>
#include <iterator>

using namespace std;

int main(void){
	int n,i;
	vector<int> intv;

	while(cin >> n){
		intv.push_back(n);
		if(intv.size() == 5) break;
	}

	//cout << "input ended" << endl;

	sort(intv.begin(), intv.end());
	
	/*
	for(i=intv.size();i>1;i--){
		cout << intv[i-1] << " ";
	}

	cout << intv[0] << endl;
	*/
	
	vector<int>::iterator it = intv.end() - 1;
	while(it != intv.begin()){
		cout << *it << " ";
		--it;
	}

	cout << *it << endl;

	return 0;
}