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 <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 = 0; i < 5; ++i)
        cout << ((i!=0)? " ": "") << a[i];
    cout << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
#include<vector>
using namespace std;
#define rep(i,n)for(int i=0;i<n;i++)

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int a,b,c,d,e;
  while(cin >> a >> b >> c>> d>> e){
    vector<int> v;
    v.push_back(a);
    v.push_back(b);
    v.push_back(c);
    v.push_back(d);
    v.push_back(e);
    sort(v.begin(), v.end(), greater<int>());
    cout << v[0] <<" "<<v[1]<<" "<<v[2]<<" "<<v[3]<<" "<<v[4]<<endl;
  }
  return 0;
}

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

int main(){
   int a,b,c,d,e,t;
   cin >> a >> b >> c >> d >> e;

   for(int i=0; i<25; i++){
	   if(b > a){
		t = a;
		a = b;
		b = t;
	   }else if(c > b){
		t = b;
		b = c;
		c = t;
	   }else if(d > c){
		t = c;
		c = d;
		d = t;
	   }else if(e > d){
		t = d;
		d = e;
		e = t;
	   }
   }

   cout << a << " " << b << " " << c << " " << d << " " << e << endl;

   return 0;
}

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

int main(int argc, const char * argv[])
{
    int n[5];
    for (int i = 0; i < 5; i++) {
        scanf("%d", &n[i]);
    }
    sort(&n[0], &n[5]);
    reverse(&n[0], &n[5]);
    
    for (int i = 0; i < 5; i++) {
        printf("%d", n[i]);
        if (i != 4) {
            printf(" ");
        }
    }
    puts("");
    
    return 0;
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>
#include<algorithm>

using namespace std;

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

  cin<<a[0]<<a[1]<<a[2]<<a[3]<<a[4];

  sort(a,a+5);

  printf("%d %d %d %d %d", a[0],a[1],a[2],a[3],a[4]);

}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <unordered_map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007

#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int ddx[8]={-1,-1,0,1,1,1,0,-1};
int ddy[8]={0,1,1,1,0,-1,-1,-1};
bool debug=false;

/*---------------------------------------------------*/

int main(){
  int a[5];
  rep(i,5)cin>>a[i];
  sort(a,a+5,greater<int>());
  rep(i,5){
    if(i==4)cout<<a[i]<<endl;
    else cout<<a[i]<<" ";
  }
  return 0;
}

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

int main(){
	std::array<int, 5> num;
	
	while(std::cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4]){
		sort(num.begin(), num.end(), std::greater<int>());
		std::cout << num[0] <<" "<< num[1] << " " << num[2] <<" "<< num[3] << " " << num[4] << std::endl;
		}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>

typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;

int main(){
	int n = 5;

	vector<int> aa;

	REP(i, n){
		int a;
		cin >> a;
		aa.push_back(a);
	}

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

	int i(0);
	for (auto x : aa){
		cout << x;
		if (i != 4){
			cout << " ";
		}
		++i;
	}
	cout << endl;

	return 0;
}

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

int main(){
	int ans[6],i;
	for(i = 0;i < 5;i++){
		cin>>ans[i];
	}
	sort(ans,ans+5);

	while(i--){
		if(i == 4)
		cout<<ans[i];
		else
		cout<<" "<<ans[i];
	}
	cout<<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,greater<int>());
	for(int i=0;i<5;++i){
		std::cout<<a[i]<<' ';
	}
	return 0;
}

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

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

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    vector<int> a(5);
    rep(i, 5)
    {
        cin >> a[i];
    }
    sort(ALL(a), greater<int>());
    rep(i, 5)
    {
        cout << a[i];
        if (i != 4)
        {
            cout << " ";
        }
    }
    cout << endl;
    return 0;
}

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

using namespace std;

int v[5];

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

    sort(v, v + 5);
    reverse(v, v + 5);

    printf("%d %d %d %d %d\n", v[0], v[1], v[2], v[3], v[4]);

    return 0;
}

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 << a[i] << " ";
  cout << endl;
}

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

int main() {
  int a[5];
  while (1) {
    for (int i=0; i<5; i++) {
      cin >> a[i];
    }
    if (cin.eof()) break;
    sort(a, a+5, greater<int>());
    for (int i=0; i<5; i++) {
      cout << a[i] << " ";
    }
    cout << "\b" << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<stdlib.h>
using namespace std;
int compare(const void *a,const void *b){
	return *(int*)b-*(int*)a;
}

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

C++: #include <stdio.h>
#include <algorithm>
using namespace std;

int main(){
	int a[5];
	scanf("%d %d %d %d %d",&a[0],&a[1],&a[2],&a[3],&a[4]);
	sort(a,a + 5);
	reverse(a,a + 5);
	printf("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);
	return 0;
}