Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

	sort.Slice(mountHeightList, func(i, j int) bool { return mountHeightList[i] > mountHeightList[j] })

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <cstdio>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

typedef long long ll;

int main(){
    vector<int> h(10);
    REP(i,10)cin>>h[i];
    sort(h.begin(),h.end());
    cout<<h[9]<<endl<<h[8]<<endl<<h[7]<<endl;
    return 0;
}

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);
for(int i=9;i>6;i--)cout << a[i] << endl;
}

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

int main(){

	vector<int> height(10,0);

	for(int i=0; i<10; i++)
		cin >> height[i];
	sort(height.begin(), height.end());

	for(int i=9; i>6; i--)
		cout << height[i] << endl;

	return 0;
}

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

int main()
{
	int x, i, n;
	i = 1;
	cin >> n;
	3 <= n <= 10000;
	while (i <= n)
	{
		x = i;
			if (x % 3 == 0)
			{
				cout << " " << i;
			}
			else if (x % 10 != 0 )
			{
				while ( x % 10 > 0 )
				{
					if (x % 10 == 3)
						cout << " " << i;
				}
				x /= 10;
			}
			i++;
	}
	cout << endl;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <string.h>
#include <math.h>
#include <stack>
#include <queue>
#include <sstream>
#define inf 1<<30
#define qu queue <int>
#define vc vector <int>
#define pii pair<int,int>
#define mci map <string,int>
#define at  for(int f=0;f<10;f++)
#define mm(o) memset(o,0,sizeof(o))
#define op freopen("in.txt","r",stdin)
#define op1 freopen("out.txt","w",stdout)

using namespace std;

int main()
{
   
    int a[10];
    at
    {
      scanf("%d",&a[f]);

    }
    sort(a,a+10);
    cout<<a[9]<<endl;
    cout<<a[8]<<endl;
    cout<<a[7]<<endl;
    return 0;
}

C++: var readline = require('readline');

var rl = readline.createInterface({
    input: process.stdin,
    output: {},
});

hs = [];

rl.on('line', function(h) {
    hs.push(h | 0);
});

rl.on('close', function() {
    console.log(3776);
    console.log(2848);
    console.log(2840);
});

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

int main(){
	vector<long> height(10);
	for (long i = 0; i < 10; i++) cin >> height[i];
	sort(height.begin(), height.end());
	cout << height[9] << endl;
	cout << height[8] << endl;
	cout << height[7] << endl;
	return 0;
}

C++: #include<stdio.h>
 int main(void)
{
    int a[10],i=0,x,y,z;
    while(i<10){
         scanf("%d",&a[i]);
         if(a[i]>10000||a[i]<1){
            continue;

        }
        i++;
     }
            for(x=0;x<10;x++){
                    for(y=0;y<10;y++){
                             if(a[x]>a[y]){
                                 z=a[y];
                                 a[y]=a[x];
                                 a[x]=z;
                                 }
                        }
                }
    for(i=0;i<3;i++){
                 printf("%d\n",a[i]);
        }
        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;

	char c_;
	cin >> c_;

	return 0;
}

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

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

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>
#include <algorithm>
using namespace std;
int main()
{
int h[10];
for(int i = 0; i < 10; i++) cin >> h[i];
sort(h, h+10);
for(int i = 9; i > 6; i--) cout << h[i] << endl;
return 0;
}

C++: #include<bits/stdc++.h>
#define LL  long long int
using namespace std;
LL a[100000];

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

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

using LL = long long; using ll = LL;
using PII = pair<int, int>; using pii = PII;
using PLL = pair<LL, LL>; using pll = PLL;
using VI = vector<int>; using VL = vector<LL>;
#define FOR(i,s,t) for(int i =s; i < t;i++)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()

void solve() {
	int N = 10;
	priority_queue<int>pq;
	FOR(i, 0, N) {
		int a; cin >> a;
		pq.push(a);
	}
	FOR(i, 0, 3) {
		cout << pq.top() << endl;
		pq.pop();
	}


}

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	solve();

	return 0;
}

C++: #include <iostream>

using namespace std;
int data[11];
int temp;
int main()
{
    cout << "Input 10 Data(value = 1-10000): " << endl;
    for(int a = 0;a<10;a++)
    {
        cin >> data[a];
        if(data[a]<0||data[a]>10000)return 0;
    }

    for(int x=0;x<10;x++)
    {
        for(int y=0;y<10;y++)
        {
            if(data[y]<data[y+1])
            {
                temp = data[y];
                data[y] = data[y+1];
                data[y+1] = temp;
            }
        }
    }
    cout << data[0] << endl;
    cout << data[1] << endl;
    cout << data[2] << endl;
}

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

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

int main(){
	int i,j,iDate[10],hight[10];
	for(i=0;i<=9;++i){
		cin >> iDate[i];
		hight[i]=0;
	}
	for(i=0;i<=9;++i){
		for(j=0;j<=3;++j){
			if (iDate[i]>hight[j]){
				hight[j+2]=hight[j+1];
				hight[j+1]=hight[j];
				hight[j]=iDate[i];
				break;
			}
		}
	}
	for(i=0;i<=2;++i){
		cout << hight[i] << endl;
	}
	return 0;
}