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>
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] << endl;
	return 0;
}

C++: #define scanf_s scanf
//#define gets_s gets
#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
using namespace std;
#define MAX 81
#define _MAX 100
#define ABC 26
int main(void)
{
	int a[5],b;
	for (int i = 0; i < 5;++i){
		scanf_s("%d", &a[i]);
	}
	for (int i = 0; i < 5; ++i) {
		for (int j = 4; j > i; --j) {
			if (a[j] > a[j - 1]) {
				b = a[j - 1]; a[j - 1] = a[j]; a[j] = b;
			}
		}
	}
	for (int i = 0; i < 5; ++i) {
		if (i != 0)printf(" ");
		printf("%d", a[i]);
	}
}

C++: #include <cstdio>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
    int a[5];
    rep(i, 5) scanf("%d", a + i);
    rep(i, 5) rep(j, 5) if(a[i] > a[j]) std::swap(a[i], a[j]);
    rep(i, 5) printf("%d%c", a[i], i == 4 ? '\n' : ' ');
    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]<<" ";
}
	return 0;
}

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


using namespace std;

int main() {
	
	vector<int> v;
	v.resize(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++) {
		cout << v[i] << " ";
	}
	
	cout << endl;
	
	return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>

using namespace std;

int main(){

	int array[5];
	scanf("%d %d %d %d %d",&array[0],&array[1],&array[2],&array[3],&array[4]);

	for(int i=1;i<=4;i++){
		for(int k=4;k>=i;k--){
			if(array[k]>array[k-1])swap(array[k],array[k-1]);
		}
	}

	for(int i=0;i<4;i++)printf("%d ",array[i]);
	printf("%d\n",array[4]);

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

  cout << a[4];
  for( int i=3;i>=0;--i )
    cout << " " << a[i];
  cout << endl;

  return 0;
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define ALL(a) (a).begin(),(a).end()
#define all(a) (a).begin(),(a).end()

int main(void) {
  vector<int> nums;
  int n;

  rep(i,5){
    cin >> n;
    nums.push_back(n);
  }

  sort(all(nums), greater<int>());

  rep(i,5){
    cout << nums.at(i) << " ";
  }
  cout << endl;
  return 0;
}

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

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>());
	cout << n[0];
	for (int i = 1; i < 5; i++)
		cout << " " << n[i];
	return 0;
}

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

int main()
{
	int a[5];
	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<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>

using namespace std;

int main()
{
int i,j,k,l,m,n=5;
int a[1000];
for(i=0;i<n;i++)
{
cin>>a[i];
}

sort(a,a+5);
for(i=0;i<n;i++)
{
cout<<a[i]<<endl;
}


return 0;
}

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!=5)printf(" ");
	}
	printf("\n");
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
signed main(void){
	int a[5];
	for(int i=0;i<5;i++)
		cin>>a[i];
	sort(a,a+5);
	cout<<a[4];
	for(int i=3;i>=0;i--)
		cout<<" "<<a[i];
	cout<<endl;
}

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

int compare(const void *a, const void *b)
{
  return *(int *)b-*(int *)a;
}

int main(void)
{
  int num[5];

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

  qsort((void *)num, 5, sizeof(int), compare);

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

  return 0;
}

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

using namespace std;

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

C++: #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  vector<int> v;
  for (int i = 0; i < 5; i++) {
    int n;
    cin >> n;
    v.push_back(n);
  }
  sort(v.begin(), v.end(), greater<int>());
  cout << v[0] << ' ' << v[1] << ' ' << v[2] << ' ' << v[3] << ' ' << v[4] << endl;
}

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

using namespace std;

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

    cin >> a >> b >> c >> d >> e;
    vec.push_back(a);
    vec.push_back(b);
    vec.push_back(c);
    vec.push_back(d);
    vec.push_back(e);

    sort(vec.begin(), vec.end(), greater<>());

    for (int i = 0; i < vec.size(); i++) {
        if (i > 0) cout << ' ';
        cout << vec[i];
    }
    cout << endl;
}

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

C++: #include<iostream>
using namespace std;
int main()
{
	int a, b, c, d, e, x[5], i, j, y;
	cin >> a >> b >> c >> d >> e;
	x[0] = a;
	x[1] = b;
	x[2] = c;
	x[3] = d;
	x[4] = e;
	for ( j = 0;j < 5; j++)
	{	for ( i = 0;i < 4; i++)
		{
			if (x[i] < x[i + 1])
				{
					y = x[i + 1];
					x[i + 1] = x[i];
					x[i] = y;
				}
		}
	}
	cout << x[0] << " " <<x[1] << " " << x[2] << " " << x[3] << " " << x[4];
return 0;
}