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<functional>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{ 
	int temp;
	vector<int>a;
	for(int i=0;i<10;i++){
		cin >> temp;
		a.push_back(temp);
	}
	sort(a.begin(),a.end());
	cout << a[9] << endl << a[8] << endl << a[7] << endl;
	return 0;
}

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

int main(){
    int temp;
    int key=-1;
    int data[3]={0};
    for(int i=0;i<10;i++){
        cin>>temp;
        for(int j=0;j<3;j++){
            if(temp>data[j])
            key=j;
        }
        if(key>=0){
            data[key]=temp;
            key=-1;
        }
    }
    for(int i=2;i>-1;i--){
        cout<<data[i]<<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;
    }
    return 0;
}

C++: #include<iostream>

using namespace std;

int i[10] = { };

int MaxPoint() {
	/*?????????????????§??????????????\????????????????????????????????§?????????
	???????????????????????§??????????????\??????*/
	int high=0,ret = 0;

	for (int root = 0; root < 10; root++) {
		//????????????????¬?????????¨??????????????????
			if (i[root] > high) {
					high = i[root];//?????§???????¨???¶???????????????	
					ret = root;
				}
	}
	
	return ret;
}

int main() {

	for (int n = 0; n < 10; n++)cin >> i[n];

	int SaidaiBasho; 

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

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

int main() {
    std::vector<int> hills;
    for (int i = 0; i < 10; i++) {
        std::cout << i << std::endl;
        std::string input;
        std::cin >> input;
        int height = std::stoi(input);
        hills.push_back(height);
    }

    std::sort(hills.begin(), hills.end(), std::greater<int>());
    for (int i = 0; i < 3; i++) {
        std::cout << hills[i] << std::endl;
    }

    return 0;
}

C++: #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main(){
  int m[10];
  for(int i = 0; i < 10; i++){
    cin >> m[i];
  }
   int i,j,p;
    for(int i = 0; i < 10; i++) {
    for(int j = 9; j > i; j--) {
      if(m[j] < m[j - 1]) {
        p = m[j];
        m[j] = m[j - 1];
        m[j - 1] = p;
      }
    }
    }
  cout << m[9] << endl;
  cout << m[8] << endl;
  cout << m[7] << endl;
}

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <queue>
#include <map>

using namespace std;
typedef long long I;
#define REP(i , x) for(int i = 0 ; i < x ; ++i)

int mo[10];

int main()
{
	REP(i, 10){
		cin >> mo[i];
	}
	sort(mo, mo + 10);

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

	return 0;
}

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

#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007LL
#define INF (1LL<<60LL)
#define int long long
typedef long long ll;

using namespace std;



signed main() {
	vector<ll> v(10);
	rep(i, 10) cin >> v[i];
	sort(all(v));
	reverse(all(v));
	rep(i, 3) cout << v[i] << endl;
}

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

int main()
{
    int num = 10;
    int Mountain[num];

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

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

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

    return 0;
}

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

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

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

int main(){
	vector<int> v(10, 0);
	
	for(int i=0; i < 10; i++) cin >> v[i];
	sort(v.begin(), v.end());
	for(int i=0; i < 3; i++)cout << v[9-i] << endl;
}

C++: #include<stdio.h>

int main(void){
	int i,j,k,l,x[10],highest,higher,high;
	for(i=0;i<10;i++){
		scanf("%d",&x[i]);
	}
	highest=0;
	higher=0;
	high=0;
	for(j=0;j<10;j++){
		if(x[j] > highest){
		highest=x[j];
	}
	}
	for(k=0;k<10;k++){
		if(x[k]>higher && highest > x[k]){
		higher=x[k];
	}
	}
	for(l=0;l<10;l++){
		if(x[l]>high && highest > x[l] && higher > x[l]){
		high=x[l];
		}
	}
	printf("%d\n%d\n%d\n",highest,higher,high);
	
return 0;
}

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

C++: #include<iostream>
using namespace std;
int main(){
	int a[10],k=0,tmp,i;
	for(i=0;i<10;i++)
		cin>>a[i];
	while(1){//無限ループ
		for(i=0;i<10;i++){
			if(a[i]<a[i+1]){//もし昇順でない場合
				tmp=a[i];//隣接しあう値を昇順に入れ替える
				a[i]=a[i+1];
				a[i+1]=tmp;
				k++;//カウント
			}
		}
		if(k==0) break;//入れ替える必要がなくなったら終了
		k=0;//カウントの初期化
	}
	for(i=0;i<10;i++)
		cout<<a[i]<<endl;
	return 0;
}

C++: # include "iostream"
using namespace std;

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

	for (i = 0; i < 10; i++)
		cin >> a[i];

	for (i = 1; i < 10; i++)
		for (j = 0; j < 10 - i; j++)
			if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);

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


	return 0;
}

C++: #include <iostream>
using nameplace std;
int main(){
   int h[10];
 for(int i=0;i<10;i++){
      cin>>h[i];
 }
 for(int i=0;i<10;i++){
  for(int j=0;j<10-i;j++){
        if(h[j]<h[j+1]){
          swap(h[j],h[j+1]);
         }
      }
}
cout<<h[0]<<endl;
cout<<h[1]<<endl;
cout<<h[2]<<endl;
return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;
int main() {
 int d;
 priority_queue<int> qu;
 for (int i=0;i<10;i++) { cin >> d; qu.push(d);}
 for (int i=0;i<3;i++) { cout << qu.top() << endl; qu.pop(); }
 return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
	int a=0;
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	for(int d=0;d<3;d++){
		for(int i=0;i<10;i++){
			if(vec[i]>a)a=vec[i];
		}
		std::cout<<a<<std::endl;
		for(int i=0;i<10;i++){
			if(vec[i]==a)vec[i]=0;
		}
		a=0;
	}
	return 0;
}

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

using namespace std;

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

	sort( h.begin(), h.end(), greater<int>() );

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