Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(nextString())
	if err != nil {
		fmt.Printf("strconv.Atoi failed: %v\n", err)
	}
	return n
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := 5
	array := make([]int, n)
	for i := 0; i < n; i++ {
		array[i] = nextInt()
	}
	sort.Slice(array, func(i, j int) bool { return array[i] > array[j] })
	arrayStr := fmt.Sprint(array)
	l := len(arrayStr)
	fmt.Println(arrayStr[1:(l - 1)])
}

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

void solve(){

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

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
using namespace std;

int main(){
    int num[5];
    cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];
    sort(num, num+5, greater<int>());
    printf("%d %d %d %d %d\n", num[0], num[1], num[2], num[3], num[4]);
}

C++: #include<bits/stdc++.h>
using namespace std;
signed 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-1) cout<<" ";
  }
  cout<<"\n";
}

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

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

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]);
    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<queue>
#include<cstdio>
using namespace std;
int main(){
	int i,a;
	priority_queue<int> q1;
	for(i=0;i<5;i++){
		cin>>a;
		q1.push(a);
	}
	for(i=0;i<5;i++){
		a=q1.top();
		q1.pop();
		printf("%d%c",a,i==4?'\n':' ');
	}
	return 0;
}

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

bool comp(int &a, int &b) {
	return a > b;
}

int main()
{
	int a, b, c, d, e;
	vector<int> A;
	cin >> a >> b >> c >> d >> e;
	A.push_back(a);
	A.push_back(b);
	A.push_back(c);
	A.push_back(d);
	A.push_back(e);
	sort(A.begin(), A.end(), comp);

	for (int i = 0; i < 5; i++) {
		if (i > 0) cout << " ";
		cout << A[i];
	}
	cout << endl;
}

C++: #include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>
#include<array>

using namespace std;

int main()
{
  array<int,5> a;

  for ( auto i = 0; i < 5; ++i )
    cin >> a[i];

  sort( a.begin(), a.end(), []( int x, int y ){ return x > y; } );
  
  for ( auto i = 0; i < 5; ++i )
    {
      if ( i ) cout << " ";
      cout << a[i];
    }

  cout << endl;
  
  return 0;
}

C++: #include<stdio.h>

int main ()
{
    long long int a,b,c,d,e;
    scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e);
     long long int number[30];
    long long int i, j,temp;
    number[0]=a;
    number[1]=b;
    number[2]=c;
    number[3]=d;
    number[4]=e;

    for (i = 0; i < 5; ++i)
    {
        for (j = i + 1; j < 5; ++j)
        {
            if (number[i] < number[j])
            {
                temp= number[i];
                number[i] = number[j];
                number[j] = temp;
            }
        }
    }
    a=number[0];
    b=number[1];
    c=number[2];
    d=number[3];
    e=number[4];
     printf("%lld %lld %lld %lld %lld",a,b,c,d,e);

return 0;
}

C++: #include<iostream>

using namespace std;

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

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++){
	if (i==4){
		cout<<a[4-i];
	}
	else cout<<a[4-i]<<" ";
}
cout<<endl;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(void){
  int x;
  vector<int>vec;

  for(int i=0;i<5;i++){
    cin >> x;
    vec.push_back(x);
  }
  sort(vec.begin(),vec.end(),greater<int>());
  for(vector<int>::iterator ite=vec.begin();ite!=vec.end();ite++){
    cout << *ite;
    if(ite+1!=vec.end())cout <<" ";
    else cout << endl;
  }
  return 0;
}

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

    
  return 0;
}

C++: #include<iostream>
int main(){
	int a[5],i,j,t;

	for(i=0;i<5;i++){	
	std::cin>>a[i];
	
	}
	for(i=0;i<4;i++){	
		for(j=i+1;j<5;j++){
			if(a[i]<a[j]){
				t=a[i];
				a[i]=a[j];
				a[j]=t;
		
			}
		}
	}	
		std::cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<" "<<a[3]<<" "<<a[4]<<std::endl;

return 0;
}

C++: ??? #include <iostream>
using namespace std;
int main(){
	int number[6] , i , j , ans[6] ;
	for( i=1 ; i<=5 ; i++ )
		cin >> number[i] ;
	for( i=1 ; i<=5 ; i++ ){
		for( j=i ; j<=5 ; j++ ){
			if( number[i] < number[j] )
				swap( number[i] , number[j] );
		}
		ans[i] = number[i];
		cout << ans[i] <<" ";
	}
}

C++: #include<iostream>
using namespace std;
int main(){
	int a,b,c,d,e;
	cin>>a;
	cin>>b;
	if(a<b){
		int i=0;
		i=b;
		b=a;
		a=i;
	}
	cin>>c;
	if(a<c){
		int i=0;
		i=c;
		c=a;
		a=i;
	}
	if(b<c){
		int i=0;
		i=c;
		c=b;
		b=i;
	}
	cin>>d;
	if(a<d){
		int i=0;
		i=d;
		d=a;
		a=i;
	}
	if(b<d){
		int i=0;
		i=d;
		d=b;
		b=i;
	}
	if(c<d){
		int i=0;
		i=d;
		d=c;
		c=i;
	}
	cin>>e;
	if(a<e){
		int i=0;
		i=e;
		e=a;
		a=i;
	}
	if(b<e){
		int i=0;
		i=e;
		e=b;
		b=i;
	}
	if(c<e){
		int i=0;
		i=e;
		e=c;
		c=i;
	}
	if(d<e){
		int i=0;
		i=e;
		e=d;
		d=i;
	}
	cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<endl;
}