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 <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <string>
#include <algorithm>
#include <string>
#include <climits>

#define REP(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define REG(i, a, b) for (int (i) = ((int)(a)); (i) < ((int)(b)); i++)
#define ALL(V) (V).begin(), (V).end()
#define PRINT(STR) cout << (STR) << endl

typedef long long ll;
using namespace std;

int nextInt() {
	int n = -1;
	cin >> n;
	return n;
}

int main() {
	cin.tie(0); //対話型には使えない
	ios::sync_with_stdio(false); //printfと共には使えない
	vector<int> numbers (5);
	REP(i, 5) {
		numbers[i] = nextInt();
	}
	sort(ALL(numbers));
	reverse(ALL(numbers));
	REP(i, 4) {
		cout << numbers[i] << " ";
	}
	cout << numbers[4] << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[11],date[11];
	for (int i = 1; i <= 5; i++) {
		cin >> a[i];
	}
	int dai = -999999;
	int o;
	for (int i = 1; i <= 5; i++) {
		if (i != 1) {
			cout << " ";
		}
		int dai = -999999;
		for (int z = 1; z <= 5; z++) {
			if (dai <= a[z]) {
				dai = a[z];
				o = z;
			}
		}
		date[i] = dai;
		a[o] = -9999999;
	}
	for (int i = 1; i < 5; i++) {
		cout << date[i];
	}
}

C++: #include<iostream>
#include<set>
#include<string>

int main() {
	int a, b, c, d, e;
	while (std::cin >> a >> b >> c >> d >> e) {
		std::multiset<int> sort;
		sort.insert(a); sort.insert(b); sort.insert(c); sort.insert(d); sort.insert(e);
		int i = 0;
		for (std::multiset<int>::reverse_iterator itr = sort.rbegin(); itr != sort.rend(); itr++) {
			std::cout << *itr;
			if (i < 4) std::cout << " ";
			i++;
		}
		std::cout << std::endl;
	}
	return 0;
}

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


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

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

int main() {
  int x[5],xi;
  cin >> x[0] >> x[1] >> x[2] >> x[3] >> x[4];
  for(int i=0;i<5;i++) {
    for(int j=i;j<5;j++) {
      if(x[i] < x[j]) {
        xi = x[i];
        x[i] = x[j];
        x[j] = xi;
      }
    }
  }
  for(int i=0;i<5;i++) {
    cout << x[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=4;i>=0;i--)
	{
		printf("%d",line[i]);
		if(i!=0)printf(" ");
	}
	printf("\n");
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int list[5], i, j, temp;
  cin >> list[0] >> list[1] >> list[2] >> list[3] >> list[4];
  for(i=0; i<5; i++){
    for(j=i+1; j<5; j++){
      if(list[i] <= list[j]){
	temp = list[i];
	list[i] = list[j];
	list[j] = temp;
      }
    }
  }
  for(i=0; i<4; i++)cout << list[i] << " ";
  cout << list[4] << endl;
}

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

int main()
{
	int a, b, c, d, e,sin=3,data;
	cin >> a >> b >> c >> d >> e;
	while (sin > 2) {
		sin = 1;
		if (a < b) {
			data = a;
			a = b;
			b = data;
			sin = 3;
		}
		if (b < c) {
			data = b;
			b = c;
			c = data;
			sin = 3;
		}
		if (c < d) {
			data = c;
			c = d;
			d = data;
			sin = 3;
		}
		if (d < e) {
			data = d;
			d = e;
			e = data;
			sin = 3;
		}	
	}
	cout << a << " " << b << " " << c << " " << d << " " << e << endl;
}

C++: #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define PREP(it,array) for(vector<P>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)

#define MP       make_pair
#define PB       push_back
#define ALL(x)   (x).begin(),(x).end()

const int INF = 1<<29;
const double EPS = 1e-9;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

typedef long long LL;
typedef pair<int,int> P;



int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(7); 

  int a[5];
  REP(i,5){
    int t;
    cin>>t;
    a[i]=t;
  }
  
  sort(a,a+5, greater<int>());
  
  REP(i,5){
    if(i!=0) cout << " ";
    cout << a[i];
  }
  cout << 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);
	for (int i = 4; i >= 0; i--) {
		cout << a[i] << " \n"[i == 0];
	}
	return 0;
}

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

int main() {
    int num[5];
    for(int i=0; i<5; i++) {
        cin>>num[i];
    }
    sort(num,num+5);
    for(int s=4; s>=0; s--) {
        cout<<num[s]<<endl;
    }
    return 0;
}

C++: x = sorted(map(int, raw_input().split()), reverse=True)

for e in x:
    print e,
print

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <set>

using namespace std;

int main()
{
	set<int, greater<int> > n;
	set<int>::iterator ite;
	int a;

	for(int i=0; i<5; i++){
		cin >> a;
		n.insert(a);
	}
	for(ite=n.begin(); ite!=n.end(); ite++){
		cout << *ite << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>>
#include<functional>
using namespace std;
int main(){
	int a[5];
	for(int i=0;i<5;i++)cin>>a[i];
	sort(a,a+5,greater<int>());
	cout<<a[0];
	for(int i=1;i<5;i++)cout<<' '<<a[i];
	cout<<endl;
	return 0;
}

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

int a[5];

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

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

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,a+5);
	for(int i=4;i>=0;i--)cout<<a[i]<<' ';
}

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

using namespace std;
int main(void)
{
	int a[5];
	for(int i = 0;i<5;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a,a+5);
	reverse(a,a+5);
		for(int i = 0;i < 5;i++)
		{
			printf("%d",a[i]);
			if(i <= 5) printf(" ");
		}



	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;}}}
cout<<biggest[0]<<" "<<biggest[1]<<" "<<biggest[2]<<" "<<biggest[3]<<" "<<biggest[4];
}}

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

int a[6],i;

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

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

C++: #include <iostream>
#include <cmath>
#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 < 5; ++i){
    cout << A[i];
    if(i != 5){
      cout << " ";
    }
  }
  cout << endl;
}