Go: package main

import "fmt"

func main() {
	var height int
	topHeights := [5]int{}

	for i := 0; i < 10; i++ {
		fmt.Scan(&height)

		for j := 0; j < 3; j++ {
			if topHeights[j] < height {
				topHeights[j+2] = topHeights[j+1]
				topHeights[j+1] = topHeights[j]
				topHeights[j] = height
				break
			}
		}
	}

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

C++: #include<stdio.h>

int main(){
	int top[10] = {1819, 2003, 876 ,2840, 1723, 1673, 3776, 2848, 1592, 922};
	unsigned char i = 0;
	unsigned char j = 0;
	unsigned int buf = 0;
	
	for (i = 0; i < 10; i++) {
		for (j = (1 + i); j < 10; j++) {
			if (top[i] < top[j]) {
				buf = top[i];
				top[i] = top[j];
				top[j] = buf;
			}
		}
	}
				
	for (i = 0; i < 3; i++) {
		printf("%d\n", top[i]);
	}
	
 	

	
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int h[10],one=0,two=0,three=0;
	for(int i=0;i<10;i++){
		cin>>h[i];
		if(three<h[i]){
			if(two<=h[i]){
				if(one<=h[i]){
					three=two;
					two=one;
					one=h[i];
				}else{
					three=two;
					two=h[i];
				}
			}else{
				three=h[i];
			}
		}
	}
	cout<<one<<endl<<two<<endl<<three<<endl;
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <numeric>
#include <cmath>

using namespace std;

typedef long long int lld;

const lld mod = 1e9+7;
const lld INF = 1e9;
//const lld MAXN = 1e9;

int 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] << endl;
	}


	return 0;
}

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

int main()
{
    int x[10];
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        cin >> x[i];
    int first = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > first)
            first = x[i];
    int second = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > second && first > x[i])
            second = x[i];
    int third = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > third && second > x[i])
            third = x[i];
    cout << first << endl;
    cout << second << endl;
    cout << third << endl;
}

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

using namespace std;

int main() {
  vector<int> mountains;
  for (int i = 0; i < 10; i++) {
    int mountain;
    scanf("%d", &mountain);
    mountains.push_back(mountain);
  }
  sort(mountains.begin(), mountains.end(), greater<int>());
  for (int i = 0; i < 3; i++) {
    printf("%d\n", mountains[0]);
    mountains.erase(mountains.begin());
  }
}

C++: #include<stdio.h>
int main()
{
    long long int  ansh[11],i,n,a=0,b=0,c=0;
    for(i=1;i<=10;i++){
        scanf("%lld",&ansh[i]);
        if(a<=ansh[i]){
            c=b;
            y=a;
            a=ansh[i];
        }
        else if(b<=ansh[i]){
            c=b;
            y=ansh[i];
        }
        else if(z<=ansh[i]){
            c=ansh[i];
        }
    }

    printf("%lld\n%lld\n%lld\n",a,b,c);

    return 0;
}

C++: 
#include <iostream>

using namespace std;

int main()
{
	int first = 0;
	int second = 0;
	int third = 0;
	for (int i = 0; i < 10; ++i) {
		int input;
		cin >> input;
		if (first < input) {
			third = second;
			second = first;
			first = input;
			continue;
		}
		else if (second < input) {
			third = second;
			second = input;
			continue;
		}
		else if (third < input) {
			third = input;
		}
	}

	cout << first << endl
		<< second << endl
		<< third << endl;

	return 0;
}

C++: // List_of _Top_3_Hills.cpp : ??????????????? ??¢????????±????????§????????¨????????? ?????????????????????????????????
//

#include <stdio.h>

#define sort 10

int main()
{
	int bab[sort], temp;
	for (int n = 0; n < sort; n++)
	{
		scanf("%d", &bab[n]);
	}
	for (int i = 0; i < sort - 1; i++)
	{
		for (int j = sort -1; j > i; j--)
		{
			if (bab[j - 1] < bab[j])
			{
				temp = bab[j];
				bab[j] = bab[j - 1];
				bab[j - 1] = temp;
			}
		}
	}
	for (int m = 0; m < 3; m++)
	{
		printf("%d\n", bab[m]);
	}
	return 0;
}

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