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

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int main(){
	ios::sync_with_stdio(false);

	vi a(5, 0);

	REP(i, 5)	scanf("%d", &a[i]);

	VSORT(a);

	REPR(i, 4)	printf("%d\n", a[i]);

}

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

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

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
  vector<int> a;
  int ptr=0;
  int tmp;
  while(cin>>tmp) a.push_back(tmp);
  stable_sort(a.begin(),a.end(),greater<int>());
  for(int i=0;i<a.size();++i) cout<<a[i]<<" ";
  cout<<endl;
  return 0;
}

C++: #include<iostream>
int main()
{
	int n[5];
	for (int i = 0; i < 5; i++)
	{
		std::cin >> n[i];
	}
	for (int i = 0; i < 5; i++)
	{
		int max = -100001, max_index = 0;
		for (int j = i; j < 5; j++)
		{
			if (max < n[j])
			{
				max = n[j];
				max_index = j;
			}
		}
		std::swap(n[i], n[max_index]);
	}
	for (int i = 0; i < 5; i++)
	{
		std::cout << n[i] << ' ';
	}
	std::cout << '\b' << std::endl;
	return 0;
}

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

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

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

  cout << in[0];
  for (int i = 1; i < in.size(); ++i)
    cout << " " << in[i];
  cout << endl;

  return 0;
}

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

int main() {
	int a,b,c,d,e;
	cin>>a>>b>>c>>d>>e;
	int num[]={a,b,c,d,e};
	for(int i=0;i<5;i++)
		for(int j=i+1;j<5;j++)
			if(num[i]<num[j])
				swap(num[i],num[j]);
	for(int i=0;i<5;i++)
		cout<<num[i];
	cout<<endl;
}

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

int main()
{
	int a[5];

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

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

	for(int i=0; i<5; i++)
	{
		printf("%d\n",a[i]);
	}

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

	for(int m=4; 0<=m; m--){
		cout << a[m] << " " << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define INF LLONG_MAX - 100
#define MOD 1000000007
#define fcout cout << fixed << setprecision(15)
#define int long long
#define yorn(f) puts((f)?"Yes":"No")
#define YORN(f) puts((f)?"YES":"NO")
#define lowb lower_bound
#define upb upper_bound
typedef long long ll;
typedef pair<int, int> P;
typedef priority_queue<int> pque;
int gcd(int a,int b){return b?gcd(b,a%b):a;};
int lcm(int a,int b){return a/gcd(a,b)*b;};
int mod(int a,int b){return (a+b-1)/b;};
int month[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
template<typename A, size_t N, typename T>
void Fill(A(&array)[N],const T &val){std::fill((T*)array,(T*)(array+N),val);}
template<class T>inline bool chmax(T& a,T b){if(a<b){a=b;return true;}return false;};
template<class T>inline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;};



signed main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(false);

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

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

using namespace std;

int main()
{
    int input[5];

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

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

    for (int i = 0; i < 5; i++)
        cout << input[i] << " ";
    cout << '\b\n';
//    cout << input[0] << " " << input[1] << " " << input[2] << " " << input[3];
//    cout << " " << input[4] << endl;


    return 0;
}

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

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

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

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

 return 0;
}

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

int main(){
	int a[5];
	for(int i=1;i<6;i++){
		cin>>a[i];
	}
	sort(a+1,a+6);
	for(int i=5;i>0;i--){
		cout<<a[i]<<' ';
}
	endl;
}

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

using namespace std;

int main() {
	vector<int> num(5);
	cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4];
	sort(num.begin(), num.end());
	printf("%d %d %d %d %d\n", num[0],num[1],num[2],num[3],num[4]);
	return 0;
}

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

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

int main(){
	vector<int> ret;
	int a;
	while(cin>>a) ret.push_back(a);
	sort(ret.begin(), ret.end() ,greater<int>());
	REP(i, ret.size()) {
		cout<<ret[i];
		if (i != ret.size() -1) cout << " ";
	}
	cout<<endl;
	return 0;
}

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

int main(){
	int a,b[9],c[9],d[9],f[9];
	string n[9];
	while(1){
		cin >> a >> endl;
		if(a == 0)break;
		for(int i = 0 ; i < a ; i++){
			cin >> n[i] >> b[i] >> c[i] >> d[i];
			f[i] = b[i]*3 + c[i]*0 + d[i]*1;
		}
		sort(f.begin(), f + a.end()){
		for(int j = 0 ; j < a ; j++){

		}
		for(int k = 0 ; k < a ; k++){

		}
		}
	}
	return 0;
}

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

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

  for(int i = 0; i < 5; i++){
    cin >> buf;
    nums.push_back( buf );
  }

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

  cout << nums[0];
  for(int i = 0; i < 4; i++)
    cout << ' ' << nums[i];
  cout << endl;
  return 0;
}

C++: import std.stdio;
import std.string;
import std.math;
import std.conv;
import std.algorithm;
import std.bigint;

int[] a;

void main(){

    auto s = split(readln());
    int temp;
    for(int i=0;i<5;i++){
	a ~= to!int(s[i]);;
    }
    sort!("a > b")(a);
    writef("%d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4]);

}

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

using namespace std;

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