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

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

int main()
{
  int a[5];
  
  for (int i = 0; i < 5; i++){
    cin >> a[i];
  }
  sort(a, a + 5, greater<int>());
  
  cout << a[0];
  for (int i = 1; i < 5; i++){
    cout << " " << a[i];
  }
  cout << 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++: //Sorting Five Numbers
#include<bits/stdc++.h>
using namespace std;

int v[5];

int main(){
  cin>>v[0]>>v[1]>>v[2]>>v[3]>>v[4];
  sort(v, v+5, greater<int>());
  for(int i=0; i<5; i++){
    cout<<v[i];
    if(i!=4) cout<<' ';
    else cout<<'\n';
  }
  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] >> " " >> endl;
}

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

int main(int argc, char *argv[]){
  using namespace std;
  vector<int> res;
  for (int i=0; i<5; ++i){
    int data;
    cin >> data;
    res.push_back(data);
  }
  sort(res.begin(), res.end(), greater<int>());
  vector<int>::iterator it = res.begin();
  while (it != res.end()){
    cout << *it;
    ++it;
    if (it != res.end()){
      cout << " ";
    }
  }
  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] <<" ";
	}
	cout << endl;
}

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

int main() {
	vector<int>a(5);
	for (int b = 0; b < 5; b++)cin >> a[b];
	sort(a.begin(), a.end());
	cout << a[4] << " " << a[3] << " " << a[2] << " " << a[1] << " " << a[0] << endl;
}

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

int main(){
    int n,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]<<" ";
    
        if(i==0){
            cout<<endl;
        }   
    }   
    return 0;
}

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

#define loop(i,a,b) for(int i=a ;i < b ; i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(void){
	int a[5];
	
	rep(i,5)cin>>a[i];
	
	sort(a,a+5,greater<int>());
	
	cout<<a[0];
	
	loop(i,1,5)cout<<" "<<a[i];
	
	cout<<endl;
	
	return 0;
}

C++: #include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	int a[5];
	rep(i,5) cin>>a[i];

	sort(a,a+5,greater<int>());

	rep(i,5)
	{
		cout<<a[i];
		if(i!=4)
			cout<<" ";
	}
	cout<<endl;

	return 0;
}

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

using namespace std;

int main(void){
	int val[5];
	for(int i=0;i<5;i++)
		cin >> val[i];

	sort(val,val+5);
	for(int i=5;--i;)
		cout << val[i] << " ";
	cout << val[0] << endl;

	return 0;
}

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

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

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

int main() {
	int num[5];
	scanf("%d %d %d %d %d",&num[0],&num[1],&num[2],&num[3],&num[4]);
	sort(num,num+5);
	printf("%d %d %d %d %d\n",num[4],num[3],num[2],num[1],num[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);
  for(int i=4;i>=0;i--){if(i==4)cout<<a[i];else cout <<" "<<a[i];}
  cout << "\n";
  return 0;
}

C++: #include <iostream>
#include <vector>
#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<5;i++)
    cout << n[i] << ' ';
  cout << endl;

  return 0;
}

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

int 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<4; i++) printf("%d ",a[i]);
printf("%d\n",a[4]);
return 0;
}

C++: #include <cstdio>
#include <algorithm>
#define SWAP(a,b) { a += b, b = a - b, a -= b; }
using namespace std;

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

C++: #include<iostream>

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

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

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

using namespace std;
int main()
{
int a[1000];
int i,n;
while(n--)
{

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

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

using namespace std;

int main(void) {
        vector<int> a(5, 0);

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

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

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