Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	counter := 0
	var mountain []int
	for scanner.Scan() {
		i, err := strconv.Atoi(scanner.Text())
		if err != nil {
			break
		}
		mountain = append(mountain, i)
		counter++
		if counter == 10 {
			break
		}

	}
	sort.Ints(mountain)
	fmt.Println(mountain[9])
	fmt.Println(mountain[8])
	fmt.Println(mountain[7])
}

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

#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}

using namespace std;
using ll = long long;

constexpr ll atcoder_mod = 1e9+7;

template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}

void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	auto H=vecin(10);
	sort(ALL(H),greater<int>());
	REP(i,3){
		out(H[i]);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int height[10];
	int x;

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

	for(int j=10;j>0;j--){
		for(int i=10;i>0;i--){
			if(height[i]>height[i-1]){
				x=height[i-1];
				height[i-1]=height[i];
				height[i]=x;
			}
		}
	}

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

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



}

C++: #include<cstdio>
#define rep(i,a,b) for(int i = (a); i<=(b); i++)
using namespace std;
int a[3];
int main()
{
    int i,j;
        while(scanf("%d",&i)==1)
        {
            if(i>a[0]) { a[2]=a[1]; a[1]=a[2]; a[0]=i;}
            else if(i>a[1]) { a[2]=a[1];a[1]=i;}
            else if(i>a[2]) a[2]=i;
        }
        rep(i,0,2) printf("%d\n",a[i]);
        return 0;
}

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

int main() {
    std::vector<int> hills;
    for (int i = 0; i < 10; i++) {
        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 <iostream>
#include <algorithm>

using namespace std;

int main(){

	int a[12];
	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>
#include <array>
#include <algorithm>
  
int main(){
    std::array<u_int, 10> heights;
     
    for (u_int i = 0; i < 10; ++i){
        std::cin >> heights[i];
    }
     
    std::sort(heights.begin(), heights.end(), std::greater<u_int>());
     
    for (u_int i = 0; i < 3; ++i){
        std::cout << heights[i] << std::endl;
    }
	
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(n) n.begin(),n.end()
using namespace std;

int main()
{
    const int N = 10;
    vector<int> h;
    int hnum = 0;
    rep(i,N) 
    {
        cin >> hnum;
        h.push_back(hnum);
    }

    sort(all(h));

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



    return 0;
}

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

using namespace std;

int main(){
    long long int a[10],temp,i,j;
    for(i=0;i<10;i++){
        cin>>a[i];
    }
    for(i=0;i<10;i++){
        for(j=0;j<10-i-1;j++){
            if(a[j]>a[j+1]){
                temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
    }
    for(int i=10-1;i>6;i--){
        cout<<a[i]<<"\n";
    }
    return 0;
}

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

#define BOGO 10

using namespace std;

bool is_sorted(vector<int> arr, int size)
{
	bool sorted = true;
	for(int i = 0; i < size; i++){
		if(!(arr[i] <= arr[i+1])){
			sorted = false;
		}
	}
	
	return sorted;
}

int main()
{
	vector<int> arr(BOGO);
	
	for(int i = 0; i < BOGO; i++){
		cin >> arr[i];
	}
	
	for(;;){
		if(is_sorted(arr, arr.size())){
			break;
		}
		random_shuffle(arr.begin(), arr.end());
	}
	
	cout << arr[9] << "\n" << arr[8] << "\n" << arr[7] << endl;
}

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

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

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

int main()
{
  int mt[10];
  int high[3];

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

  for(int i=0;i<=2;i++)
    {
      high[i] = 0;
    }

  for(int i=0;i<=9;i++)
    {
      if(mt[i]>=high[2])
	{
	  high[2] = mt[i];
	}
      if(mt[i]>=high[1])
	{
	  high[2] = high[1];
	  high[1] = mt[i];
	}
      if(mt[i]>=high[0])
	{
	  high[2] = high[1];
	  high[1] = high[0];
	  high[0] = mt[i];
	}
    }

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

  return 0;
}

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

int main()
{
    int height, First,Second,Third,index;
    First = Second = Third = 0;

    for(index=0; index<10; index++)
   {
      cin >> height;

      if(height > First)
      {
           Third = Second;
           Second = First;
           First = height;
      }
      else if(height > Second && height <= First)
      {
          Third = Second;
          Second = height;
      }
      else if(height > Third && height <= Second)
          Third = height;
    }


    cout << First << endl << Second << endl << Third << endl;

    return 0;
}

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

int main() {
	long long int  a[10];
	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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int m[10];
	rep(i,10)
		cin>>m[i];
	sort(m,m+10);
	cout<<m[9]<<endl;
	cout<<m[8]<<endl;
	cout<<m[7]<<endl;
	return 0;
}

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

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

C++: #include<stdio.h>

int main(void){
    int ex,i,j,high[10];


    for(i = 0;i < 10;i++){
        scanf("%d",&high[i]);
    }

    for(i = 0;i < 10;i++){
        for(j = i + 1;j < 10;j++){
            if(high[i] > high[j]){
                ex = high[i];
                high[i] = high[j];
                high[j] = ex;
            }
        }
    }

    printf("%d\n%d\n%d\n",high[9],high[8],high[7]);
    return 0;
}