Go: package main

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

var (
	n  = 10
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	heights := make([]int, n, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		heights[i], _ = strconv.Atoi(sc.Text())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heights)))

	for i := 0; i < 3; i++ {
		fmt.Println(heights[i])
	}
}

C++: #include <iostream>
using namespace std;
int main()
{
	int arr[10];
	int max1 , max2 , max3;
	int i;
	for ( i = 0 ; i < 10 ; i++)
		cin >> arr[i];
	max1 = arr[0];
	for ( i = 0 ; i < 10 ; i++)
	{
		if ( max1 < arr[i])
		{
			max3 = max2;
			max2 = max1;
			max1 = arr[i];
		}
		else if ( max2 < arr[i])
		{
			max3 = max2 ;
			max2 = arr[i];
		}
		else if ( max3 < arr[i])
		{
			max3 = arr[i];
		}
	}
	cout << max1 << endl << max2 << endl << max3 << endl ;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
    int a=-1,b=-1,c=-1,moun;
    for(int i=0;i<10;i++){
        cin>>moun;
        if(moun>a){
            c=b;
            b=a;
            a=moun;
        }else if(moun>b){
            c=b;
            b=moun;
        }else if(moun>c)
            c=moun;
    }
    cout<<a<<endl<<b<<endl<<c<<endl;
    return 0;
}

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

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

int main() {
	// your code goes here
	int data[10],ansdata[3];
	for (int j = 0;j<3;j++) {
		ansdata[j] = 0;
	}
	for (int i=0;i<=9;i++) {
		cin >> data[i];
		if (i==0) {
			ansdata[0] = data[i];
		}
		if (i>0) {
			if (data[i] > ansdata[2]) {
				if (data[i] > ansdata[1]) {
					ansdata [2] = ansdata [1];
					if (data[i] > ansdata[0]) {
						ansdata [1] = ansdata [0];
						ansdata [0] = data [i];	
					}
					else {
						ansdata[1] = data[i];
					}
					
				}
				else {
					ansdata[2] = data[i];
				}
			}

		}
	}
	cout << ansdata[0] << endl << ansdata[1] << endl << ansdata [2] ;
	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] << endl;
	cout << x[8] << endl;
	cout << x[7] << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int i, j, max;
	int v[10];
	for (i = 0; i < 10; i++) {
		cin >> v[i];
	}
	for (i = 0; i < 3; i++) {
		max = v[i];
		for (j = i; j < 10; j++) {
			if (max < v[j]) {
				max = v[j];
				v[j] = v[i];
				v[i] = max;
			}
		}

	}

	cout << v[0] <<"\n";
	cout << v[1] << "\n";
	cout << v[2] << "\n";
}

C++: #include <cstdio>
int main(){
 int top3[3];
 int i,tmp;
 for(i=0;i<10;i++){
  scanf("%d",&data);
  if (top3[2]>data) {} 
  else {
   top3[2]=data;
   if (top3[1]>data) {} 
   else {
    top3[2]=top3[1];
    if (top3[0]>data) top3[1]=data;
    else {
     top3[1]=top3[0];
     top3[0]=data;
    };
   };
  };
 };
 for(i=0;i<3;i++)
    printf("%d\n",top[i]);
};

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

int main()
{
    int x[10];
    cout << sizeof(x) << endl;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        cin >> x[i];
    int first = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > first)
            first = x[i];
    int second = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > second && first > x[i])
            second = x[i];
    int third = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > third && second > x[i])
            third = x[i];
    cout << first << endl;
    cout << second << endl;
    cout << third << endl;
}

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

#define BOGO 10

using namespace std;

int main()
{
	int arr[BOGO];
	bool found;
	int j;
	srand(static_cast<unsigned int>(time(NULL)));
	
	for(int i = 0; i < BOGO; i++){
		cin >> arr[i];
	}
	
	for(;;){
		
		/**
		for(int j = 0; j < BOGO; j++){
			cout << arr[j] << flush;
		}
		cout << endl;
		/**/
		
		found = true;
		for(j = 0; j < BOGO-1; j++){
			if(arr[j] > arr[j+1]){
				found = false;
				break;
			}
		}
		
		if(found){
			break;
		}
		random_shuffle(arr, arr+BOGO);
	}
	cout << arr[9] << "\n" << arr[8] << "\n" << arr[7] << endl;
}

C++: 
#include<stdio.h>

int main()
{
	int high[10] = {1819,2003,876,2876,1723,1673,3776,2848,1592,922};
	int cases;
	
	for(int i=0;i<10;i++)
	{
		for(int j=i;j<10;j++)
		{
			if(high[i] > high[j])
			{
				cases = high[i];
				high[i] = high[j];
				high[j] = cases;
			}
		}
	}
	
	printf("%d",high[0]);
	printf("%d",high[1]);
	printf("%d",high[2]);
	
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int a=0,b=0,c=0,t=0,n=10;
    while(n--)
    {
              cin>>t;
              if(t>c)
              {
                     if(t>b)
                     {
                            if(t>a)
                            {
                                   c=b;
                                   b=a;
                                   a=t;
                                   
                            }
                            else
                            {
                                c=b;
                                b=t;
                                }
                     }
				  else
				 {
					 c=t;
				  }
			  }
      }
              cout<<a<<endl<<b<<endl<<c<<endl;              
			  cin>>n;
   return 0;
    }

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

int main(){

	int i;
	int height[10];

	for (i = 0; i < 10; i++){
		do{
			cin >> height[i];
		} while (height[i] < 0 || height[i] > 10000);
	}

	sort(height, height + 10, greater<int>());

	for (i = 0; i < 3; i++){
		cout << height[i] << "\n";
	}

	return 0;
}

C++: #include<iostream>

using namespace std;
int main()
{
int mount[10];
for(int i=0;i<10;i++)
{
cin >> mount[i];
}
int max[3];
int count[2];
max[0] = mount[0];
max[1] = mount[0];
max[2] = mount[0];
for(int i=1;i<10;i++)
{
if(mount[i]>=max[0])
{
max[0] = mount[i];
count[0]=i;
}
}
for(int i=1;i<10;i++)
{
if(mount[i]>=max[1]&&i!=count[0])
{
max[1] = mount[i];
count[1]=i;
}
}
for(int i=1;i<10;i++)
{
if(mount[i]>=max[2]&&count[0]!=i&&count[1]!=i)
{
max[2] = mount[i];
}
}
cout << max[0] << endl;
cout << max[1] << endl;
cout << max[2] << endl;
return 0;
}

C++: #include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
typedef int long long ll;

using namespace std;
int main(){

    vector<int> v(10);
    rep(i,10){
        int x;
        cin>>x;
        v[i]=x;
    }
    sort(v.begin(),v.end(),greater<int>());
    cout<<v[0]<<endl<<v[1]<<endl<<v[2];





return 0;
}

C++: #include <bits/stdc++.h>  // g++ -std=c++14 -o a a.cpp

using namespace std;

typedef pair<int, int> P;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repto(i, n) for(int i = 0; i <= (n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end()) // ユニークなvectorにする。連続した値を除去して切り出す。
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

int main() {
  vector<int> M;
  rep(i, 10) {
    int mi;
    cin >> mi;
    M.pb(mi);
  }
  sort(all(M));
  cout << M[9] << endl;
  cout << M[8] << endl;
  cout << M[7] << endl;
}