Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)

	s := make([]int, 10)
	for i := 0; i < 10; i++ {
		s[i], _ = strconv.Atoi(read())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(s)))
	fmt.Println(s[0])
	fmt.Println(s[1])
	fmt.Println(s[2])
}

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 ] );
    }
    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<iostream>
#include<stdio.h>
using namespace std;
int main(){
    int i,j,temp,h[10];
    for(i=0;i<10;i++)
    {
        cin>>h[i];
    }
    for(i=0;i<3;i++)
    {
        for(j=0;j<10-i;j++)
        {
            if(h[j]>h[j+1])
            {
                temp=h[j];
                h[j]=h[j+1];
                h[j+1]=temp;
            }
        }
    }
    for(i=9;i>6;i--)
    {
        cout<<h[i]<<endl;
    }
    return 0;
}

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

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


int main(void)
{
    int i;
    int num[10];

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

    sort(&num[0], &num[9], greater<int>());

    printf("%d\n", num[0]);
    printf("%d\n", num[1]);
    printf("%d\n", num[2]);

    return 0;
}

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

int main() {

	unsigned int height[10];

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

	sort(height, height + 10);

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

	return 0;
}

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

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

C++: #include <stdio.h>
int main(void)
{
	int i, j, hill[10], temp;

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

	for (i = 0; i < 9; i++) {
		for (j = i; j < 10; j++) {
			if (hill[i] < hill[j]) {
				temp = hill[i];
				hill[i] = hill[j];
				hill[j] = temp;
			}
		}
	}

	for (i = 0; i < 3; i++)
		printf("%d\n", hill[i]);

	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
 
int main(void) {
  vector<int> x(10);
  int i = 0;
  for(; i < 10; i++) cin >> x[i];
  sort(x.begin(), x.end());
  for(i = 9; i > 6; i--) cout << x[i] << endl;
}

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

int main() {
    int m[10];
    
    int i;
    for(i = 0; i < 10; i++){
    	int a;
    	cin >> a;
    	m[i] = a;
    }
    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 mt[3] = {0}, i, j, k, tmp;
	for(i=0;i<10;i++){
		cin >> tmp;
		for(j=0;j<3;j++){
			if(mt[j] < tmp){
				k=2-j;
				while(k>0){
					mt[k] = mt[k-1];
					k--;
				}
				mt[j]=tmp;
				break;
			}
		}
	}
	
	for(i=0;i<3;i++){
		cout << mt[i] << endl;
	}
    return 0;
}

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

int main()
{
	long long input;
	long long first = 0;
	long long second = 0;
	long long third = 0;
	
	for (int i = 0; i < 10; i++)
	{
		cin >> input;
		// Update the tallest 3 mountains
		if (input > first)
		{
			third = second;
			second = first;
			first = input;	
		}
		else if (input > second)
		{
			third = second;
			second = input;
		}
		else if (input > third)
			third = input;
	}
	
	cout << first << endl << second << endl << third << endl;
}

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

int main() {
	int h[10];
	for (int i = 0; i < 10;i++) {
		cin >> h[i];
	}
	sort(h,h+10);
	for (int i = 9; i > 6;i--) {
		cout << h[i] << endl;
	}
	return 0;
}

C++: 
#include<bits/stdc++.h>
#include<limits.h>
using namespace std;
int main()
{
   int i,j,k=0,ar[100],first,second,third;
   first=INT_MIN;
   second=INT_MIN;
   third=INT_MIN;

   for(i=0;i<10;i++)
   {
     cin>>ar[i];
   }
   for(i=0;i<10;i++)
   {
     if(ar[i]>first)
     {
       third=second;
       second=first;
       first=ar[i];
     }
     else if(ar[i]>second){
      third=second;
      second=ar[i];
     }
     else if(ar[i]>third)
     {
       third=ar[i];
     }
   }
   cout<<first<<endl;
   cout<<second<<endl;
   cout<<third<<endl;



    return 0;
}

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

int Size = 10;

int main(void) {
    int height[Size];
    
    for(int i = 0; i < Size; ++i) {
        cout << "No." << i + 1 << " : " << flush;
        cin >> height[i];
    }
    sort(height, height + Size);
    
    cout << height[9] << endl
         << height[8] << endl
         << height[7] << endl;
}

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

int main(){
	priority_queue<int> Q;
	for(int i=0;i<10;i++){
		int h;
		cin >> h;
		Q.push(h);
	}
	for(int i=0;i<3;i++){
		cout << Q.top() << endl;
		Q.pop();
	}
}