Go: package main

import (
	"fmt"
	"sort"
)

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

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

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

C++: #include<stdio.h>
int main(void) {
	int i, mountain[10],x,y;
	int n = 0;
	int l = 0;
	int m = 0;
	for (i = 0;i < 10;i++) {
		scanf("%d", &mountain[i]);
	}
	for (i = 0;i < 10;i++) {
		if (mountain[i] > m) m = mountain[i];
		x = i;
	}
	printf("%d\n", m);
	for (i = 0;i < 10;i++) {
		if (i != x) {
			if (mountain[i] > n) n = mountain[i];
			y = i;
		}
	}
	printf("%d\n", n);
	for (i = 0;i < 10; i++) {
		if (i != y) {
			if (mountain[i] > l) l = mountain[i];
		}
	}
	printf("%d\n", l);

	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int A[3]; int a,b,c;for(int i=0;i<10;i++){
		cin>>a;if(a>A[0]){b=A[0];A[0]=a;c=A[1];A[1]=b;A[2]=c;}
		else if(a>A[1]){b=A[1];A[1]=a;A[2]=b;}
		else if(a>A[2]){A[2]=a;}
} 
cout<<A[0]<<endl<<A[1]<<endl<<A[2]<<endl;
return 0;
}

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

int main(){
    vector<int>vec;
    for(int i=0;i<10;i++){
        int c;
        cin>>c;
        vec.push_back(c);
    }
    sort(vec.begin(),vec.end(),greater<int>());
    for(int i=0;i<3;i++){
        cout<<vec[i]<<endl;
    }
}

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

using namespace std;

int main(){
	vector<int> mountain;
	for(int i = 0;i < 10;i++){
		int x = 0;
		cin >> x;
		mountain.push_back(x);
	}
	sort(mountain.begin(),mountain.end(),greater<int>());
	vector<int>::iterator it = mountain.begin();
	cout << *it << endl;
	it++;
	cout << *it << endl;
	it++;
	cout << *it << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int i, j, t, a[10];
	for (i = 0; i < 10;i++)
		cin >> a[i];
	for (j = 0; j <9; j++)
	for (i = 0; i < 9 - j; i++)
	if (a[i] < a[i + 1])
	{
		t = a[i]; a[i] = a[i + 1]; a[i + 1] = t;
	}
	cout << a[0];
	cout << "\n";
	cout << a[1];
	cout << "\n";
	cout << a[2];
	cout << "\n";
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>

using namespace std;
#define TOSTRING(x) #x
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
#define PAU 

typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 28);
const ll LINF = 1e18;
const double PI = acos(-1);

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vi Height(10);
	REP(i, 10) {
		cin >> Height[i];
	}
	so(Height); rev(Height);
	REP(i, 3) {
		cout << Height[i] << endl;
	}
	PAU;
	return 0;
}

C++: #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	int a[10];
	int ans;
	int max1 = 0;
	int max2 = 0;
	int max3 = 0;
	int j;
	for (int i = 0; i < 10; i++){
		cin >> a[i];
	}
	for (int b = 0; b < 3; b++){
		for (int i = 0; i < 10; i++){
			if (max1 < a[i]){
				max1 = a[i];
				j = i;
			}

		}
		cout << max1 << endl;
		max1 = 0;
		a[j] = 0;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef vector<int> VI;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )

int main() {
    int tmp;
    VI heights;
    while (cin >> tmp) {
        heights.push_back(tmp);
    }
    sort(heights.begin(), heights.end(), [](int a, int b){return a > b;});
    
    REP(i, 0, 3) {
        cout << heights[i] << endl;
    }
    
    return 0;
}

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

int main()
{
    std::vector<int> array_mount;

    for ( int i = 0; i < 10; i++ )
    {
        int tmp = 0;
        std::cin >> tmp;
        array_mount.push_back(tmp);
    }

    std::sort( array_mount.begin(), array_mount.end(), std::greater<int>() );

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

    return 0;
}

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

int main(){
    int a[10];
    for(int i=0;i<10;++i){
        cin >> a[i];
    }
    for(int i=0;i<10;++i){
        int j=i;
        int tmp=a[i];
        while (j>=1 && a[j]<a[j-1])
            {
                tmp=a[j-1]; a[j-1]=a[j];a[j]=tmp;
                --j;
            }
    }
        cout << a[9] << endl;
        cout << a[8] << endl;
        cout << a[7] << endl;
}

C++: #include<iostream>
#include<algorithm>
 
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<<a[8]<<endl<<a[7]<<endl;
 
}

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

int a[4];

int main()
{
    for (int i = 0; i < 10; i++)
    {
        cin >> a[3];
        for (int j = 2; j >= 0; j--)
        {
            if (a[j] < a[j+1])
            {
                swap(a[j], a[j+1]);
            }
        }
    }
    for (int i = 0; i < 3; i++)
    {
        cout << a[i] << endl;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	typedef unsigned short int mew;
	mew mountain[10];
	for (int i = 0; i < 10; i++) {
		cin >> mountain[i];
	}

	mew taller[3];
	mew a, b, c;

	a = mountain[0];
	b = mountain[1];
	c = mountain[2];

	for (int y = 3; y <= 9; y++) {
		if (a<=b){
			if (a<=c){
				if (a < mountain[y]) {
				???a = mountain[y];}
			}
			else{
				if (c < mountain[y]) {
					c = mountain[y];}
			}
		}
		else if (b<=c)
		{
			if (b < mountain[y]) {
				b = mountain[y];}
		}
	}

	//biggest->taller[0],bigger->taller[1],taller[2]
	{
		if (a >= b&&a >= c)
		{
			taller[0] = a;
			if (b >= c)
			{
				taller[1] = b;
				taller[2] = c;
			}
			else {
				taller[1] = c;
				taller[2] = b;
			}
		}
		if (b >= a&&b >= c)
		{
			taller[0] = b;
			if (a >= c)
			{
				taller[1] = a;
				taller[2] = c;
			}
			else {
				taller[1] = c;
				taller[2] = a;
			}
		}
		if (c >= b&&c >= a)
		{
			taller[0] = c;
			if (b >= a)
			{
				taller[1] = b;
				taller[2] = a;
			}
			else {
				taller[1] = a;
				taller[2] = b;
			}
		}
	} 

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

	return 0;
}

C++: ///
// File:  0001.cpp
// Author: ymiyamoto
//
// Created on Sat Nov  4 15:34:23 2017
//

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

int32_t main()
{
  vector<uint32_t> heights(10);

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

  sort(heights.begin(), heights.end());

  cout << heights[heights.size() - 1] << endl;
  cout << heights[heights.size() - 2] << endl;
  cout << heights[heights.size() - 3] << endl;

  return 0;
}

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

using namespace std;

vector< int > adj;

int main()
{
    for(int i = 1; i <= 10; i++){
        int x;
        cin>> x;
        adj.push_back(x);
    }
    sort(adj.begin(), adj.end());
    cout<< adj[9] <<'\n' << adj[8] <<'\n' << adj[7];
}