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>
using namespace std;
int main() {
	vector<int> s;
	int a, b, c, d, e,i,j,change;
	cin >> a >> b >> c >> d >> e;
	s.push_back(a);
	s.push_back(b);
	s.push_back(c);
	s.push_back(d);
	s.push_back(e);
	for (i = 0; i < 4; i++) {
		for (j = 0; j < 4-i; j++) {
			if (s[j] < s[j + 1]) {
				change = s[j];
				s[j] = s[j+1];
				s[j+1] = change;
			}
		}
    }
	cout << s[0] << " " << s[1] << " " << s[2] << " " << s[3] << " " << s[4];
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

int main()
{
	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 <stdio.h>
#include <algorithm>
using namespace std;

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

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

int main()
{
  int a[5]={0};
  int i;
  for(i=0; i<5; i++){
    scanf("%d", &a[i]);
  }

  sort(a,a+5);

  for(i=4; i>=0; i--){
    printf("%d ",a[i]);
  }
  puts("");
}

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

using namespace std;

int arr[5];

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

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



int main(void)
{
  int i=0;
  int aiTable[5];
  int v[5];

cin>>aiTable[0]>>aiTable[1]>>aiTable[2]>>aiTable[3]>>aiTable[4];
    
 sort(aiTable, aiTable + 5);

for(i=0;i<5;i++)
{
v[4-i]=aiTable[i];
}

for(i=0;i<5;i++)
    {
	cout<<v[i]<<" ";
    }
//cout<<endl;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  vector<int> n(5);
  for(int i=0; i<5; i++) cin >>n[i];
  sort(n.begin(),n.end());
  for(int i=4; i>=0; i--){
    cout <<n[i];
    if(i>0) cout <<" ";
    else cout <<endl;
  }
  return 0;
}

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

using namespace std;

int main()
{
    vector<int> a(5);
    for (int i = 0; i < 5; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < 5; i++) {
        if (i > 0) cout << " ";
        cout << a[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=4;i>-1;i--){
		std::cout<<vec[i];
		if(i!=0)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]);
		}

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; 0 < i; --i)
        cout << ((i!=0)? " ": "") << a[i];
    cout << endl;
    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(t,t+5);
	cout<<a[0];
	for(int j=1;j>=5;j++){
		cout<<" "<<a[j];
	    }
	cout<<endl;
	return 0;
	}

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

using namespace std;

int main()
{
	int num[5];
	
	for (int i = 0; i < 5; i++){
		cin >> num[i];
	}
	
	for (int i = 0; i < 5; i++){
		for (int j = 0; j < 5; j++){
			if (num[i] <= num[j]){
				swap(num[i], num[j]);
			}
		}
	}
	
	cout << num[0];
	for (int i = 1; i < 5; i++){
		cout << " " << num[i];
	}
	cout << endl;
	
	return (0);
}

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

int main() {
    std::array<long long int, 5> arr;
    std::cin >> arr[0] >> arr[1] >> arr[2]
             >> arr[3] >> arr[4];
    std::sort(arr.begin(), arr.end(), std::greater<long long int>());

    std::cout << arr[0] << " " << arr[1] << " "
              << arr[2] << " " << arr[3] << " "
              << arr[4] << std::endl;
    
    return 0;
}

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

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

C++: #include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
	vector<int>v;
	int i,j,k;
	for(i=0;i<5;i++){
		scanf("%d",&j);
		v.push_back(j);}
	sort(v.begin(),v.end());
	for(i=4;i>=0;i--){
		printf("%d",v[i]);
		if(i!=0)printf(" ");}
	printf("\n");
	return 0;}

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

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

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

int main()
{
	vector<int> n;
	int x;
	for (int i = 0; i < 5; ++i){
		cin >> x;
		n.push_back(x);
	}

	sort(n.begin(), n.end(),greater<int>());

	for (int i = 0; i < 5; ++i){
		cout << n[i];
		if (i != 4)
			cout << " ";
	}

	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s

int main()
{
	vector<int> v;
	REP(i, 5)
	{
		int tmp;
		cin >> tmp;
		v.push_back(tmp);
	}
	sort(v.begin(), v.end(), greater<int>());
	REP(i, 4) cout << v[i]<<" ";
	cout << v[4] << endl;
	return 0;
}

C++: #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>

using namespace std;

//Nayeem Shahriar Joy,Applied Physics And Electronic Engineering,University of Rajshahi.

int main(void)

{
    vector<int>p;

    int a;

    int w=5;

    while(w--)

    {
        cin>>a;
        p.push_back(a);
    }

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

    for(int i=p.size()-1;i>=0;i--)
    {
        cout<<p[i]<<" ";
    }
    return 0;
}

C++: #include <bits/stdc++.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 i = 4; i >= 0; --i) {
		cout << num[i] << " ";
	}
	cout << endl;
}