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<stdio.h>
#include<string.h>
#include<math.h>
#include <bits/stdc++.h>

using namespace std;

int main ()
{
    int a[9],i;

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

    int n= sizeof(a)/sizeof(a[0]);

    sort(a,a+n);

    for(i=8;i>5;--i)
    {
        printf("%d\n",a[i]);
    }
    return 0;
}

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

using _i64 = int64_t;
using _u64 = uint64_t;
using _f64 = double;

#define _for(i, start, end) for(_i64 i = (_i64)start; i < (_i64)end; ++i)
#define _rep(i, number) _for(i, 0, number)
#define _foreach(e, data) for(auto& e : data)
#define _all(data) data.begin(), data.end()

template<typename type>
_i64 _size(const type& data) { return static_cast<_i64>(data.size()); }
template<typename type, size_t size>
_i64 _size(const type (&)[size]) { return static_cast<_i64>(size); }

enum _flag : bool { able = true, disable = false };

struct _time {
    _time(_flag flag) { check = flag; if(!check) { return; } gettime(start); }
    ~_time() {
        if(!check) { return; }; gettime(end);
        _i64 elapse = chrono::duration_cast<chrono::milliseconds>(end - start).count();
        cout << endl << "Time: " << elapse << " ms" << endl;
    }
    private:
    using _timer = chrono::time_point<chrono::system_clock>;
    _timer start, end; bool check;
    void gettime(_timer& time) { time = chrono::system_clock::now(); }
};

struct _ini { _ini() { ios::sync_with_stdio(false); cin.tie(nullptr); } } _ini;

int main() {
    {
        _time time(disable);
        vector<_i64> mountain(10);
        _foreach(e, mountain) { cin >> e; }
        sort(_all(mountain), greater<_i64>());
        _rep(i, 3) { cout << mountain[i] << endl; }
    }
    return 0;
}

C++: #include<bits/stdc++.h>
/*#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<climits>*/
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define rep1(i,a,b) for(int i=a;i<=(b);++i)
#define per(i,a,b) for(int i=a;i>(b);--i)
#define per1(i,a,b) for(int i=a;i>=(b);--i)
#define LL long long
#define inf 0x7f7f7f7f
#define N 10010
using namespace std;
int a[N];
bool cmp(int a,int b)
{
	return a>b;
}
int main()
{
	int i=0;
	while(~scanf("%d",&a[i++]));
	sort(a,a+i-1,cmp);
	printf("%d\n%d\n%d",a[0],a[1],a[2]);
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;
int i=0;
for(;i<10;i++){
cin>>input[i];
if(first<input[i]){first = input[i];}else 
if(second<input[i]){second = input[i];}else 
if(third<input[i]){third = input[i];}
}
cout<<first<<endl;cout<<second<<endl;cout<<third<<endl;
return 0;

}

C++: #include<stdio.h>
int main(void){
	int i,j,a=0,b=0,c=0,yama;
	
	for(i=0;i<=9;i++){
		scanf("%d",&yama);
		
		if(a<yama){
			
			b=a;
			a=yama;
			
		}else if(b<yama){
			
			c=b;
			b=yama;
			
		}else if(c<yama){
			
			c=yama;
			
		}
	}
	
	printf("%d\n%d\n%d\n",a,b,c);
	
	return 0;
}

C++: #include <iostream>

void swap(int *a, int *b);

int main(void)
{
int b[3]={0,0,0};
int i=0;
for(; i < 10; i++){
int s;
scanf("%d",&s);
if(b[2] < s){b[2]=s);}
if(b[1] < b[2]){swap(&b[1],&b[2]);}
if(b[0] < b[1]){swap(&b[0],&b[1]);}
}
std::cout << b[0] << std::endl << b[1] << std::endl << b[2] << std::endl;
return 0;
}

void swap(int *a, int *b){
int c=*a;
*a=*b;*b=c;
return;
}

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

int main(void)
{
	std::priority_queue<int> height_array;
	int height;
	
	for(int i=0; i<10; i++){
		std::cin >> height;
		height_array.push(height);
	}
	
	for(int i=0; i<3; i++){
		std::cout << height_array.top() << std::endl;
		height_array.pop();
	}
	
	
	return 0;
	
}

C++: #include <cstdio>
#include <algorithm>
using namespace std;
int main(void){
int a[10];
int i;
for(i=0;i<10;i++){
scanf("%d",&(a[i]));
}
sort(a,a+10);
for(i=0;i<3;i++){
printf("%d\n",a[i]);
}
return 0;
}

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

int main() {
	multiset<int, greater<int>> st; int temp;
	for (int i = 0; i < 10; i++) { cin >> temp; st.insert(temp); }
	auto itr = st.begin();
	for (int i = 0; i < 3; i++) { cout << *itr << endl; ++itr; }
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  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 <iostream>
#include <algorithm>
using namespace std;

int main(void) {
    int height[10];
    
    for(int i = 0; i < 10; ++i) {
        while(!(0 <= height[i] & height[i] <= 10000)) {
            cout << "No." << i + 1 << " : " << flush;
            cin >> height[i];
        }
    }
    sort(height, height + 10);
    
    for(int i = 0; i < 3; ++i) {
        cout << height[9 - i] << endl;
    }
}

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

using namespace std;

int main(){
	int hills[10];
    
    for(int i=0;i<10;i++) cin >> hills[i];
    
	partial_sort( hills, hills + 3, hills+10, greater<int>() );
    
    for(int i=0;i<3;i++) cout << hills[i] <<endl;
    
	return 0;
}

C++: #include<iostream>

using namespace std;

void sort(int data[]) {
    for(int i = 0; i < 9; i++) {
        for(int j = i; j < 10; j++) {
            if(data[i] < data[j]) {
                int tmp = data[i];
                data[i] = data[j];
                data[j] = tmp;
            }
        }
    }
}

int main(void) {
    int i, hills[10];

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

    sort(hills);

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

    return 0;
}

C++: #include <iostream>
using namespace std;
main() {
  int a[10];
  for(int i=0;i<10;i++) scanf("%d",&a[i]);
  sort(a,a+10,greater<int>());
  printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
}

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

int main() {
    return ([]() {
        std::function<void()> input;
        std::vector <int> list;
        (input = [&input, &list]() {
            int data;
            if ( std::cin >> data ) {
                list.push_back( data );
                input();
            }
        })();
        ([&list]() {
            sort( list.rbegin(), list.rend() );
            for_each( list.begin(), list.begin() + 3, [](int x){ std::cout << x << std::endl; } );
        })();
        return 0;
    })();
}

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

int main(){
	int x[10];
	for (int i = 0; i < 10; i++){
		cin >> x[i];
	}
	sort(begin(x), end(x));
	cout << x[9];
	cout << x[8];
	cout << x[7];
	
}

C++: #include<bits/stdc++.h>
/*#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<climits>*/
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define rep1(i,a,b) for(int i=a;i<=(b);++i)
#define per(i,a,b) for(int i=a;i>(b);--i)
#define per1(i,a,b) for(int i=a;i>=(b);--i)
#define LL long long
#define inf 0x7f7f7f7f
#define N 10010
using namespace std;
int a[N];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int i=0;
    while(~scanf("%d",&a[i++]));
    sort(a,a+i-1,cmp);
    printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
}