Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	var a, b, c, d, e int
	fmt.Scan(&a, &b, &c, &d, &e)
	dataset := []int{a, b, c, d, e}

	sort.Sort(sort.Reverse(sort.IntSlice(dataset)))
	fmt.Printf("%d %d %d %d %d\n", dataset[0], dataset[1], dataset[2], dataset[3], dataset[4])
}

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

using namespace std;

void solve()
{
	vector<int> Num(5);
	for(int i = 0; i < 5; ++i)
	{
		cin >> Num[i];
	}
	sort(Num.begin(), Num.end(), greater<int>() );
	for(int i = 0; i < 5; ++i)
	{
		if(i == 4)
		{
			cout << Num[i];
		}
		else
		{
			cout << Num[i] << " ";
		}
	}
	cout << endl;
}

int main()
{
	solve();
	return(0);
}

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

int main(){
    int a[5],tmp;
    int i,j;
    for(i=0;i<5;i++)scanf("%d",&a[i]);
    for(i=0;i<5;i++){
        for(j=5;j>i;j--){
            if(a[j-1]<a[j]){
                tmp = a[j];
                a[j] = a[j-1];
                a[j-1] = tmp;
            }
        }
    }
    for(i=0;i<5;i++){
        printf("%d",a[i]);
        printf((i-4)? " " : "\n");
    }
}

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

int main()
{
	vector<int> Number(5);
	for(int i = 0; i < 5; i++){
		scanf("%d", &Number[i]);
	}
	sort(Number.begin(), Number.end(), greater<int>());
	for(int i = 0; i < 5; i++){
		if(i != 4){
			printf("%d ", Number[i]);
		}else{
			printf("%d\n", Number[i]);
		}
	}
	return 0;
}

C++: #include<iostream>
#include<string>
#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--)(i==4)?cout<<a[i]<<endl:cout<<a[i]<<" ";
	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int main() {
	int a[5];
	rep(i, 5)scanf("%d", &a[i]);
	sort(a, a + 5, greater<>());
	rep(i, 5)cout << a[i] << (i == 4 ? '\n' : ' ');
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
	long long a[5],i;
	for(i=0;i<5;i++)cin>>a[i];
	for(i=1;i<5;i++)if(a[0]<a[i])swap(a[0],a[i]);
	for(i=2;i<5;i++)if(a[1]<a[i])swap(a[1],a[i]);
	for(i=3;i<5;i++)if(a[2]<a[i])swap(a[2],a[i]);
	if(a[3]<a[4])swap(a[3],a[4]);
	for(i=0;i<5;i++){
		if(i==4){
			cout<<a[i];
		}else{
			cout<<a[i]<<" ";
		}
	}
	cout<<endl;
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int num[5];
  
  for(int i = 0; i = 4; i++)
    cin >> num[i];

  sort(num, num + 5);

  for(int i = 4; i = 0; i--)
    cout << num[i] << " ";

  cout << endl;
}

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

using namespace std;

int main(void)
{
	int a,b,c,d,e;
	while(cin>>a>>b>>c>>d>>e)
	{
		deque<int> nums;
		nums.push_back(a);
		nums.push_back(b);
		nums.push_back(c);
		nums.push_back(d);
		nums.push_back(e);
		sort( nums.begin(), nums.end(), greater<int>() );
		deque<int>::iterator it = nums.begin();
		while( it != nums.end() )
		{
			cout <<*it<<' ';
			++it;
		}
		puts("");
	}
	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 >= 1; --i) {
	cout<<a[i]<<" ";
}
cout<<a[0]<<endl;
	return 0;
}

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

int main()
{
	std::vector<int> v(5);

	for(int i=0;i<5;++i)
	{
		std::cin >> v[i];
	}

	std::sort(v.begin(),v.end());

	for(int i=4;i>=0;--i)
	{
		std::cout << v[i] << ' ';
	}
}

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