Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mt := make([]int, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mt[i])
	}

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

C++: #include<string>
#include<algorithm>
#include<iostream>
#include<cstdio>
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----------------------------------------------------------------------------------------------------------------------
#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 - 1 ] );
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(void)
{
	int input[10];

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


	for(int i = 3; i < 10; i++){
		for(int j = 0; j < 3; j++){
			if(input[i] > input[j]){
				input[j] = input[i];
				break;
			}
		}
	}

	sort(input, input+3, less<int>());

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


	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
    
    int h[10], i;
    
    for(i = 0; i < 10; i++){
        
        cin >> h[i];
        
        if(h[i] < 0 || h[i] > 10000)
            i--;
    }
    
    int a = 0, b = 0, c = 0, temp;
    
    for(i = 0; i < 10; i++){
        
        if(h[i] > c){
            c = h[i];
            if(c > b){
                temp = b;
                b = c;
                c = temp;
                if(b > a){
                    temp = a;
                    a = b;
                    b = temp;
                }
            }
        }
    }
    
    cout << a << "\n" << b << "\n" << c << "\n";
    
    return 0;
}

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

int main(){
	int mountain[10], first=0, second=0, third=0;
	for(int j=0; j<10; j++){
		mountain[j]=0;
	}

	for(int i=0; i<10; i++){
		cin >> mountain[i];
		if(first <= mountain[i]){
			third = second;
			second = first;			
			first = mountain[i];
		}
		else if(mountain[i]<=first && mountain[i]>=second){
			third = second;
			second = mountain[i];
		}
		else if(mountain[i]<=second && mountain[i]>=third){
			third = mountain[i];
		}
	}
	cout << first << "\n" << second << "\n" << third << endl;

	return 0;
}

C++: #include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <cstdio>
#include <cctype>
#include <queue>
#include <complex>
#include <climits>

typedef long long ll;

using namespace std;

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

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

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

	return 0;
}

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

int Size = 10;

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

C++: #include <stdio.h>

int main(){
	int talls[10], max, banme;
	for(int i = 0; i < 10; i++) scanf("%d", &talls[i]);
	for(int i = 0; i < 3; i++){
		max = 0;
		for(int j = 0; j < 10; j++){
			if(max < talls[j]){
				max = talls[j];
				banme = j;
			}
		}
		printf("%d\n", max);
		talls[banme] = 0;
	}
	return 0;
}

C++: #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;
const int INF = 0x7fffffff;

int gcd(int x,int y){
  int mi,ma;
  ma = max(x,y);
  mi = min(x,y);
  if(ma % mi == 0){
    return mi;
  }
  else{
    return gcd(mi,ma % mi);
  }
}

int main(){
  long ii,jj,kk;
  vector<int> a;

  int mnt[10];
  for(ii=0;ii<10;ii++){
    cin >> mnt[ii];
  }
  int sw;
  for(ii=0;ii<9;ii++){
    for(jj=ii+1;jj<10;jj++){
      if(mnt[ii] < mnt[jj]){
        sw = mnt[ii];
        mnt[ii] = mnt[jj];
        mnt[jj] = sw;
      }
    }
  }
  
  for(ii=0;ii<3;ii++){
    cout << mnt[ii] << endl;
  }
  return 0;
  
}

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

int a[3],n;

int main(){
  a[0] = 0;
  a[1] = 0;
  a[2] = 0;
  for(int i = 0; i < 10; i++){
    cin >> n;
    if(a[2] > n){
      break;
    }else{
      if(a[1] > n){
        a[2] = n;
      }else{
        if(a[0] > n){
          a[2] = a[1];
          a[1] = n;
        }else{
          a[2] = a[1];
          a[1] = a[0];
          a[0] = n;
        }
      }
    }
  }
  cout << a[0] << endl << a[1] << andl << a[2] << endl
}

C++: #include<cstdio>
#include<algorithm>


int main(){
using namespace std;
        int m[10] = {0};
        int i;
        for(i = 0; i < 10; i++){
                scanf("%d", &m[i]);
        }
        sort(m, m + 10);
        reverse(m, m + 10);

        for(i = 0; i < 3; i++){
                printf("%d\n", m[i]);
        }
        return 0;
}

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

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