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>
int main(){
	int a[10];
	int b;
	for (int i = 0; i < 10; i++){
		std::cin >> a[i];
	}

	for (int i = 0; i < 10; i++){
		for (int j = i + 1; j < 11; j++){
			if (a[i] < a[j]){
				b = a[i];
				a[i] = a[j];
				a[j] = b;
			}
		}
	}

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

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

using namespace std;

int main()
{
    int mount[10];

    for (int i = 0; i < 10; i++)
        cin >> mount[i];
    sort(mount, mount + 10);

    for (int i = 9; i > 6; i--)
        cout << mount[i] << '\n';

    return 0;
}

C++: #include<stdio.h>#include<algorithm>using std::sort;main(){int x[10],i;for(i=0;i<10;i++)scanf("%d",&x[i]);sort(x,x+10);printf("%d\n%d\n%d",x[9],x[8],x[7]);}

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

using namespace std;

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

	cout << h[9] << endl << h[8] << endl << h[7] << endl;

	return 0;
}

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

int main() {
	int a[9] = { 0 };
	

	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 <iostream>
using namespace std;

int main(){
	bool completed,flag;
	int result[3],buf,temp[10];
	for(int i = 0; i < 10; i++){
		cin >> temp[i];
	}
	for(int l = 0; l < 3; l++{
		while(1){
			for(int j = l; j < 9; j++){
				if(temp[j] < temp[j+1]){
					buf = temp[j+1];
					temp[j+1] = temp[j];
					temp[j] = buf;
				}
			}
			flag = false
			for(int k = 0; k < 9; k++){
				if(temp[0] < temp[k]) flag = true;
			}
			if(flag != true) result[l] = temp[l];
			break;
		}
	}
	cout << result[0] << endl;
	cout << result[1] << endl;
	cout << result[2] << endl;
	return 0;
}

C++: #include <iostream>

int main()
{
    int i,high[10];
    for(i = 0;i < 10;++i){
        std::cin >> high[i];
    }
    sort(high[0]);
    std::cout << high[0];
    std::cout << high[1];
    std::cout << high[2];
}

void sort(int *a)
{
    int i,first = 0,secand = 0,third = 0;
    for(i = 0;i < 10;++i){
       if(first < *(a + i)){
           first = *(a + i);
       }else if(secand < *(a + i)){
           secand = *(a + i);
       }else if(third < *(a + i)){
           third = *(a + i);
       }
    }
    *a = first;
    *(a + 1) = secand;
    *(a + 2) = third;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	int n[10];
	for(int p=0;p<10;p++){
		cin>>n[p];
	}
	sort(n,n+10);
	 cout<<n[9]<<endl;
	 cout<<n[8]<<endl;
	 cout<<n[7]<<endl;
}

C++: #include <stdio.h>
#include <queue>

using namespace std;

int main(void) {
	int height[10];
	priority_queue<int,vector<int>> que;
	
	for(int i=0;i<10;i++){
		scanf("%d",&height[i]);
		que.push(height[i]);
	}
	for(int i=0; i<3; i++){
		printf("%d\n",que.top());
		que.pop();
	}
	
	return 0;
}

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

int main(){
	
	int height[10] = {};

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

	int f = 0, s = 0, t = 0;

	for (int i = 0; i < 9; i++){
		if (height[i] >= t){
			t = height[i];
		}
		if (t >= s){
			swap(s, t);
		}
		if (s >= f){
		swap(f,s);
		}
	}
    
	cout << f << "\n" << s << "\n" << t << endl;

		return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main()
{
    vector<int>vec;
    for(int i = 0;i < 10;++i)
    {
        int v; cin >> v;
        vec.push_back(v);
    }
    sort(vec.begin(),vec.end());
    cout << vec[9] <<endl<< vec[8] <<endl << vec[7] <<endl;
    return 0;
}

C++: /*
List of Top 3 Hills
?±±???????????????????????????????????´??°??§??¨?????? 10 ?????????????????????????????????
?????? 10 ?????????????????????????????????
???????????§????????????????????????????????????????????°?????????????????????????????????
*/

#include <iostream>
#include <array>

using namespace std;

int main()
{
	// ?????°??£?¨?
	array< int, 10 > array1;

	// ??\?????????
	for ( int i = 0; i < 10; i++ ) {
		cin >> array1[ i ];
	}

	// ???????????????
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 0; j < i; j++ ) {
			if ( array1[ j ] > array1[ i ] ) {
				int tmp = array1[ i ];
				array1[ i ] = array1[ j ];
				array1[ j ] = tmp;
			}
		}
	}

	// ????????????
	cout << array1[ 9 ] << endl << array1[ 8 ] << endl << array1[ 7 ] << endl;

	return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;

for(int i,i<10,i++){
cin>>input[i];
if(first<input){
 first = input[i];
}else if(second<input){
 second = input[i];
}else if(third<input){
 third = input[i];
}


}
cout<<first<<endl<<second<<endl<<third<<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(){

	int a[10];

	 for(int i=0; i<10; i++){

	 	cin >> a[i];
	 }

	 for(int t=0; t<9; t++){

	 	for(int s=t+1; s<10; s++ ){

	 		if(a[s]>a[t]){

	 			int num=a[s];

	 			a[s]=a[t];

	 			a[t] = num;
	 		}
	 	}
	 }

	 for (int j=0; j<3; j++){

	 	cout << a[j] << endl;
	 }
}