Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mountains := make([]int, 10, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mountains[i])
	}

	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))

	for i := 0; i < 3; i++ {
		fmt.Println(mountains[i])
	}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int x[10001],i;
    for(i=0;0<=i && i<=10000;++i){
        cin>>x[i];
    }
    sort(x);
    cout<<x[0]<<endl;
    cout<<x[1]<<endl;
    cout<<x[2]<<endl;
    return 0;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }
template<class T> ostream& operator << (ostream& ros, const vector<T> vec){ vrep(v, vec) ros << *v << ' '; ros << '\b'; return ros; }
template<class T> ostream& operator << (ostream& ros, const pair<vector<T>, int> p){ rep(i, p.second) ros << p.first[i] << ' '; ros << '\b'; return ros; }
template<class T> ostream& operator << (ostream& ros, const pair<T*, int> p){ rep(i, p.second) ros << p.first[i] << ' '; ros << '\b'; return ros; }
template<class T, size_t S> ostream& operator << (ostream& ros, const T (&arr)[S]){ rep(i, S) ros << arr[i] << ' '; ros << '\b'; return ros; }

const int    INF = 1000000000;
const ll     MOD = 1000000007LL;
const double EPS = 1E-12;

const int n = 10;
int a[n];

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

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

  cout << mp(a, 3) << endl;

  return 0;
}

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

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

int main(void){
   int i,a[10];
   for(i=0; i<10; i++)
    cin>>a[i];
    sort(a,a+10);
    for(int i=0;i<3; i++)
    cout<<a[9-i]<<endl;
}

C++: #import<cstdio>
#import<deque>
#import<algorithm>
main(){int n,i;std::deque<int>h;while(~scanf("%d",&n))h.push_back(n);sort(h.begin(),h.end());for(i=9;i>6;)printf("%d\n",h[i--]);}

C++: #include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a[10];
for(int i=0;i<10;i++){	cin >> a[i];
}sort(a,a+10);
cout<<a[9]<<endl;
cout<<a[8]<<endl;	
cout<<a[7]<<endl;
return 0;
}

C++: //include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
 
//using namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
 
//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
//const------------------------------------------------------------------------------------------------------------------------
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
//global-----------------------------------------------------------------------------------------------------------------------
vector<int> a(10);
 
//function---------------------------------------------------------------------------------------------------------------------
int main() {
    rep( i, 10 ) {
        scanf( "%d", &a[ i ] );
    }
    sort( a.begin(), a.end() );
    ROF( i, 9, 7 ) {
        printf( "%d\n", a[ i - 1 ] );
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(void)
{
	int input[10];

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


	for(int i = 3; i < 10; i++){
		for(int j = 0; j < 3; j++){
			if(input[i] > input[j]){
				input[j] = input[i];
				break;
			}
		}
	}

	sort(input, input+3, less<int>());

	for(int i = 0; i < 3; i++){
		cout << input[i] << endl;
	}


	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
    
    int h[10], i;
    
    for(i = 0; i < 10; i++){
        
        cin >> h[i];
        
        if(h[i] < 0 || h[i] > 10000)
            i--;
    }
    
    int a = 0, b = 0, c = 0, temp;
    
    for(i = 0; i < 10; i++){
        
        if(h[i] > c){
            c = h[i];
            if(c > b){
                temp = b;
                b = c;
                c = temp;
                if(b > a){
                    temp = a;
                    a = b;
                    b = temp;
                }
            }
        }
    }
    
    cout << a << "\n" << b << "\n" << c << "\n";
    
    return 0;
}

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

int main(){
	int mountain[10], first=0, second=0, third=0;
	for(int j=0; j<10; j++){
		mountain[j]=0;
	}

	for(int i=0; i<10; i++){
		cin >> mountain[i];
		if(first <= mountain[i]){
			third = second;
			second = first;			
			first = mountain[i];
		}
		else if(mountain[i]<=first && mountain[i]>=second){
			third = second;
			second = mountain[i];
		}
		else if(mountain[i]<=second && mountain[i]>=third){
			third = mountain[i];
		}
	}
	cout << first << "\n" << second << "\n" << third << endl;

	return 0;
}

C++: #include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

using namespace std;

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

	sort(h, h+10, greater<int>());

	cout << h[0] << endl << h[1] << endl << h[2];

	return 0;
}