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 <cmath>
#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>());
  for(int i = 0; i < 5; ++i){
    cout << A[i] << " ";
  }
  cout << endl;
}

C++: #include<stdio.h>

int main(void)
{
	int a,b,c,d,e,x[5],t=0;
	scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);

	for(t;t<5;t++)
	if(a>=b&&a>=c&&a>=d&&a>=e)
	{
		x[t]=a;
		a=-1;
	}
	else if(b>=c&&b>=d&&b>=e)
	{
		x[t]=b;
		b=-1;
	}
	else if(c>=d&&c>=e)
	{
		x[t]=c;
		c=-1;
	}
	else if(d>=e)
	{
		x[t]=d;
		d=-1;
	}
	else
	{
		x[t]=e;
		e=-1;
	}

	printf("%d %d %d %d %d\n",x[0],x[1],x[2],x[3],x[4]);
	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);
    int b[5];
    for(int i=0;i<5;i++){
       b[4-i]=a[i];
    }
    cout<<b[0]<<" "<<b[1]<<" "<<b[2]<<" "<<b[3]<<" "<<b[4]<<endl;
}

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

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

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

C++: #include <bits/stdc++.h>
using namespace std;
bool comp(int i,int j)
{
    return (i>j);
}

int main()
{

   int a[10];


   int x,i;

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






    sort(a,a+5,comp);
    int size=5;
    for(i=0; i<size; i++)
    {

        printf("%d",a[i]);
        if(i<size-1)
        printf(" ");
    }
    printf("\n");
    return 0;



}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main(){
	int a[5];
	for(int i=0;i<5;i++) cin >> a[i];
	while(1){
		bool j = true;
		for(int i=0;i<4;i++){
			if(a[i]<a[i+1]){
				int t = a[i];
				a[i] = a[i+1];
				a[i+1] = t;
				j = false;
			}
		}
		if(j) break;
	}
	for(int i=0;i<4;i++) cout << a[i] << " ";
	cout << a[4] << endl;
}

C++: //04
#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]<<((i!=4)?' ':'\n');
  }
  return 0;
}

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

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

C++: #include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main() {
	int num,a=0,b=0,draw;
	int *line = new int[5];
	for (int w = 0; w < 5; w++) {
		cin>>line[w];
	}
	for (int w = 0; w < 5; w++) {
		for (int q = 0;q < 4; q++) {
			if (line[q] < line[q + 1])swap(line[q], line[q + 1]);
		}
	}
	for (int w = 0; w < 5; w++) {
		cout << line[w];
		if (w < 4)cout << " ";
		else cout << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
  int b,i;vector <int> v;
  for(i=0;i<5;i++) {
    cin >> b;
    v.push_back(b);
  }
  sort(v.rbegin(),v.rend());
  cout << v[0];
  for(i=1;i<5;i++) cout << " " << v[i];
  cout << endl;
}

C++: 
#include <iostream>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a)  (a).begin(),(a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
const double EPS = 1e-10;
const double PI  = acos(-1.0);
#define dump(x) cerr << "  (L" << __LINE__ << ") " << #x << " = " << (x) << endl;
#define dumpv(x) cerr << "  (L" << __LINE__ << ") " << #x << " = "; REP(q,(x).size()) cerr << (x)[q] << " "; cerr << endl;
template<typename T1, typename T2>
ostream& operator<<(ostream& s, const pair<T1, T2>& d) {return s << "(" << d.first << "," << d.second << ")";}


int main() {
  VI a(5);
  REP(i, a.size()) cin >> a[i];
  sort(a.rbegin(), a.rend());
  REP(i, a.size()) cout << (i == 0 ? "" : " ") << a[i];
  cout << endl;
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  vector<int> vec;
  rep(i, 5){
    int x;
    cin >> x;
    vec.pb(x);
  }
  sort(vec.begin(), vec.end());
  rep(i, 5){
    cout << vec[4 - i];
    if(i != 4)cout << " ";
    else cout << endl;
  }
	return 0;
}

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

int main() {
  int a[5];
  for (auto& e : a) {
    cin >> e;
  }
  sort(a, a + 5);
  for (int i = 4; i > 0; i--) {
    cout << a[i] << " ";
  }
  cout << a[0] << endl;
}

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

int main(){
	int num[5];
	int i,j,tmp;

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

	for(i = 0; i < 5; i++){
		for(j = 5; j > i; j--){
			if(num[j] > num[i]){
				tmp = num[j];
				num[j]  = num[i];
				num[i] = tmp;
			}
		}
	}

	for(i = 0; i < 5; i++)
		cout << num[i] << ' ';
	cout << endl;

	return 0;
}

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

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

double dot(P a,P b){return real(conj(a)*b);};
double cross(P a,P b){return imag(conj(a)*b);};

int main(){
  vi a(5);
  REP(i,5)cin>>a[i];
  sort(ALL(a));
  reverse(ALL(a));
  cout<<a[0];
  REPR(i,5)cout<<" "<<a[i];
  cout<<endl;
  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=5;i>0;)
{
i--;
aiTable[i]=v[4-i];
}

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

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<functional>
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,greater<int>());
  printf("%d %d %d %d %d",num[0],num[1],num[2],num[3],num[4]);
}