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 <bits/stdc++.h>

using namespace std;

using ll = long long;

int main(void) {
    vector<int> arr(10);
    for (int i = 0; i < 10; i++)
        scanf("%d", &arr[i]);
    sort(arr.rbegin(), arr.rend());
    printf("%d\n%d\n%d\n", arr[0], arr[1], arr[2]);
    return 0;
}

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

C++: #include <iostream>
#include <string>   
using namespace std;
 
int main(){
int rank[3],a[10],i = 0,ii = 0,b,c;
rank[0] = 0;
rank[1] = 0;
rank[2] = 0;
while(i <= 9){
	cin >> a[i];
	while(ii <= 2){
		if(rank[ii] < a[i]){
			b = 2 - ii;
			c = ii;
			while(c >= 1){
				c--;
				rank[c] = rank[c-1];
			}			
			rank[ii] = a[i];

			break;	
		}
		ii++;
	}
i++;
ii = 0;

}
cout<<rank[0]<<endl<<rank[1]<<endl<<rank[2]<<endl;




}

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

int main(){
int h[10];

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

a=0;
for(i=0; i<10; i++){
if(h[a]<h[i]) a=i;
}
cout << h[a] << endl;

h[a]=0;
a=0;
for(i=0; i<10; i++){
if(h[a]<h[i]) a=i;
}
cout << h[a] << endl;
h[a]=0;
a=0;
for(i=0; i<10; i++){
if(h[a]<h[i]) a=i;
}
cout << h[a] << endl;

return 0;
}

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

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

	for( int j = 0; j < 10; j++ ) {
		for ( int i = 0; i < 10-1; i++ ) {
			if( mt[ i ] < mt[ i+1 ] ) {
				int tmp = mt[ i+1 ];
				mt[ i+1 ] = mt[ i ];
				mt[ i ] = tmp;
			}
		}
	}

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

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

C++: 

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>

#define LLI long long
#define LLU unsigned long long
#define pi 2*acos(0.0)

#define scan(x) scanf("%d",&x)


int dir[8][2]={{-1,0}
              ,{1,0}
              ,{0,-1}
              ,{0,1}
              ,{-1,-1}
              ,{-1,1}
              ,{1,-1}
              ,{1,1}};


using namespace std;


int main()
{
    int mou[10];
    for(int i=0 ;i < 10 ; i++)
    {
        scan(mou[i]);
    }

    sort(mou,mou+10);

    printf("%d\n%d\n%d\n",mou[9],mou[8],mou[7]);

	return 0;
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
int n;
using namespace std;
int main(){
	std::ios::sync_with_stdio(false);
	priority_queue <int > dp;

	while(cin>>n){
		dp.push(n);
	}
	for(int i=0;i<3;i++){
		int output=dp.top();
		dp.pop();
		cout<<output<<"\n";
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int first=0,second=0,third=0;
    int moun[10];
    for(int i=0;i<10;i++){
        cin >> moun[i];
    }
    for(int i=0;i<10;i++){
        first<moun[i] ? first=moun[i]:first;
    }
    cout << first << endl;
    for(int i=0;i<10;i++){
        second<moun[i] && moun[i]<first ? second=moun[i]:second;
    }
    cout << second << endl;
    for(int i=0;i<10;i++){
        third<moun[i] && moun[i]<second ? third=moun[i]:third;
    }
    cout << third << endl;
    return 0;
}

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

int hills[10] ;
int tops[3] = {0,0,0} ;

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

		if( hills[i] >= tops[0] )
		{
			tops[2] = tops[1] ;
			tops[1] = tops[0] ;
			tops[0] = hills[i] ;
		}
		else if( hills[i] >= tops[1] )
		{
			tops[2] = tops[1] ;
			tops[1] = hills[i] ;
		}
		else if( hills[i] >= tops[2] )
		{
			tops[2] = hills[i] ;
		}
	}

	for( int i = 0 ; i < 3 ; i ++ )
	{
		cout << tops[i] << "\n" ;
	}

	_getch() ;
	return 0 ;
}

C++: #include <iostream>
using namespace std;
int main(int argc, const char * argv[])
{
    int height[10], i, height1 = 0, height2 = 0, height3 = 0;
    for (i = 0; i < 10; i++) {
        cin >> height[i];
        if (height1 < height[i]) {
            height1 = height[i];
        }
    }
    for (i = 0; i < 10; i++) {
        if (height2 < height[i] && height[i] != height1) {
            height2 = height[i];
        }
    }
    for (i = 0; i < 10; i++) {
        if (height3 < height[i] && height[i] != height1 && height2 != height[i]) {
            height3 = height[i];
        }
    }
    cout << height1 << endl;
    cout << height2 << endl;
    cout << height3 << endl;
    return 0;
}

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

int main()
{

        std::vector<int> vec;
        int a;

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

        std::sort(vec.begin(),vec.end());

        for(int i = 0; i < 3; ++i) std::cout << vec.at(9-i) << std::endl;

        return 0;
}

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

int mountain[12]

int main() {
  for (int i = 0; i < 10; ++i){
    cin >> mountain[i];
  }
  sort(mountain,mountain+10)

  cout << mountain[9] << endl
  << mountain[8] << endl
  << mountain[7] << endl;
}

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

int main() {
  vector <int> a(10);
  int x;
  for (int i = 0; i < 10; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  cout << "Hey" << endl;
  for (int i = 9; i > 6; i--) { 
    cout << a[i] << endl;
  }
  return 0;
}

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

const int MAX_N = 9;
int a[MAX_N];
  
int main(){

    for(int i=0; i<=MAX_N; i++){
        cin >> a[i];
    }
     
    sort(a,a+10);
    cout << a[9] << endl << a[8] << endl << a[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=0;i<3;i++)cout<<a[i]<<endl;
}

C++: #include<iostream>
using namespace std;
int main()
{
int i,h,m1,m2,m3;
m1=0;
m2=0;
m3=0;
for(i=0;i<10;i++)
{
	cin>>h;
	if(h>m1)
	{
		m3=m2;
		m2=m1; 
		m1=h;
	}
	else if(h>m2)
	{
		m3=m2;
		m2=h;
	}
	else if(h>m3)
	{
		m3=h;
	}
}
cout<<m1<<endl;
cout<<m2<<endl;
cout<<m3;
}

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

int main(){
    int i, j, damy, mthei[10];

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

	for(i = 0; i < 10; i++){
		for(j = i + 1; j < 10; j++){
			if(mthei[i] < mthei[j]){
				damy = mthei[i];
				mthei[i] = mthei[j];
				mthei[j] = damy;
			}
		}
	}

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

	return 0;
}

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

int main()
{
	int top, stop, sstop, obj;
	top = stop = sstop = 0;
	for (int i = 0; i < 10; i++){
		cin >> obj;
		if (obj > top){
			sstop = stop;
			stop = top;
			top = obj;
		}else if (obj > stop){
			sstop = stop;
			stop = obj;
		}else if (obj > sstop){
			sstop = obj;
		}
	}
	cout << top << "\n" << stop << "\n" << sstop << endl;
}