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++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

int main()
{
	string str;
	int num[5];
	for(int i=0;i<5;i++){
		scanf("%d",num+i);
	}
	sort(num,num+5,greater<int>());

	for(int i=0;i<5;i++){
		printf("%d%s",num[i],i==4 ? '\n' : ' ');
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>

using namespace std;

int main() {

	int no[5];

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

	for (int i = 0; i < 5; i++) {
		for (int j = 0; j < 4; j++) {
			if (no[j] < no[j + 1])
				swap(no[j], no[j + 1]);
		}
	}

	for (int i = 0; i < 5; i++) {
		if (i != 0) putchar(' ');
		cout << no[i];
	}
	putchar('\n');

	return 0;
}

C++: #include <cmath>
#include <iostream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>

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] <<(i==0 ? '\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=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++: /* All men have limits. They learn what they are and learn
   not to exceed them, I ignore mine. -Batman           */

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

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

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

typedef uint32_t u32;
typedef uint64_t u64;

int main() {

  u64 a[5];
  for(u32 i = 0; i < 5; ++i) {
    std::cin >> a[i];
  }

  std::sort(a, a + 5);
  std::reverse(a, a + 5);

  std::cout << a[0];
  for(int i = 1; i < 5; ++i) {
    std::cout << " " << a[i];
  }
  std::cout << std::endl;
  
  return 0;
}

C++: #include <bits/stdc++.h>
#define LL long long
#define rep(i,n) for (int i=0;i<(n);i++)
//#define rep(i,x,n) for (int i=x;i<(n);i++)
using namespace std;
int main(){
	
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	vector<int> vc;
	while(cin >> n){
		vc.push_back(n);
	}
	sort(vc.begin(), vc.end(), greater<int>());
	for(auto x : vc){
		cout << x << " ";
	}
	return 0;
}

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

int input_data[5];

int main(void){
	for(int i = 0; i < 5; i++){
		scanf("%d", &input_data[i]);
	}
	for(int i = 0; i < 5; i++){
		for(int j = i + 1; j < 5; j++){
			if(input_data[i] < input_data[j]){
				swap(input_data[i], input_data[j]);
			}
		}
	}
	for(int i = 0; i < 5; i++){
		printf("%d", input_data[i]);
		if(i != 4) printf(" ");
	}
	printf("\n");
	return 0;
}

C++: #include <iostream>

int main() {
	int n[5];
	for(int i=0; i<5; i++)
		std::cin >> n[i];
	for(int i=4; i>0; i--){
		for(int j=0; j<i; j++){
			if(n[j] < n[j+1]){
				int t = n[j];
				n[j] = n[j+1];
				n[j+1] = t;
			}
		}
	}
	for(int i=0; i<5; i++){
		std::cout << n[i];
		if(i<4)
			std::cout << ' ';
	}
	return 0;
}

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

int main(){
  int a,b,c,d,e;
  vector<int> l;

  while(cin>>a>>b>>c>>d>>e){

    l.push_back(a);
    l.push_back(b);
    l.push_back(c);
    l.push_back(d);
    l.push_back(e);

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

    for(int i=4; i>=0; i--){
      cout<<l[i];
      if(i) cout<<" ";
    }
    cout<<endl;
    l.clear();
  }
}

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

int main(int argc, char *argv[]){
	int a[5];
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4];
	for (int j = 0; j < 4; ++j){
		for (int i = 0; i < 4; ++i){			
			if(a[i]<a[i+1]){
				int tmp;
				tmp=a[i];
				a[i]=a[i+1];
				a[i+1]=tmp;
			}
		}
	}
	for (int i = 0; i < 5; ++i){
		cout<<a[i]<<" ";	
	}
	cout<<endl;
    return 0;
}

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

int main() {
  vector<int> v(5);
  for(int i = 0; i < 5; ++i) {
    cin >> v[i];
  }
  sort(v.begin(), v.end(), greater<int>());
  for(int i = 0; i < 5; ++i) {
    if(i) cout << " ";
    cout << v[i];
  }
  cout << endl;
  return 0;
}

C++: #include<iostream>
#include<vector>
std::vector<int> qsort(std::vector<int> xs);


int main(){
	std::vector<int> vec(5);
	for(int i=0;i<5;i++){
		std::cin>>vec[i];
	}
	vec=qsort(vec);
	for(int i=0;i<5;i++){
		std::cout<<vec[i];
		if(i!=4)std::cout<<" ";
	}
	std::cout<<std::endl;
	
	return 0;
}

std::vector<int> qsort(std::vector<int> xs){

	if(xs.empty())return xs;
	else{
			int x=xs[0];
		std::vector<int> left;
		std::vector<int> right;
		for(int i=1;i<xs.size();i++){
			if(x>xs[i])left.push_back(xs[i]);
			else if(x<=xs[i])right.push_back(xs[i]);
		}
		left=qsort(left);
		right=qsort(right);
		left.push_back(x);
		left.insert(left.end(),right.begin(),right.end());
		return left;
	}
}

C++: #include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<iomanip>
#include<string>
#include<algorithm>
using namespace std;

int gcd(long long int m,long long int n){
	while(m!=n){
		if(m>n){m=m-n;
		}
		else n=n-m;
	}
	return m;
}
int lmc(long long int m,long long int n){
return m*n/gcd(m,n);
}

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

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

using namespace std;

int main(void) {
	int num[5];
	while(1) {
		cin >> num[0];
		if(cin.eof())		break;
		
		for(int i = 1; i < 5; i++) {
			cin >> num[i];
		}
		sort(num, num + 5);
		for(int i = 4; i >= 0; i--) {
			cout << num[i] << ' ';
		}
		cout << endl;
	}
	
	return 0;
}

C++: #include<iostream>
#include<stdlib.h>
using namespace std;
int compare(const void *a,const void *b){
	return *(int*)b-*(int*)a;
}

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
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 <algorithm>

#define SIZE 5

using namespace std;

int main() {
	int list[5];
	for (int i = 0; i < SIZE; i++) {
		cin >> list[i];
	}

	sort(list, list+SIZE);

	for (int i = 0; i < SIZE - 1; i++) {
		cout << list[SIZE - i - 1] << " ";
	}
	cout << list[0] << endl;

	return 0;
}

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

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

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;
	
}