Go: package main

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

var maxint = 10000
var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	scanner.Scan()
	return strconv.Atoi(scanner.Text())
}

func main() {
	scanner.Split(bufio.ScanWords)
	arr := make([]int, 10)
	for i := range arr {
		n, _ := nextInt()
		arr[i] = n
	}

	sort.Slice(arr, func(i, j int) bool {
		return arr[i] >= arr[j]
	})

	arrStr := fmt.Sprintf("%+v", arr[0:3])
	arrStr = arrStr[1:(len(arrStr) - 1)]
	arrStr = strings.Replace(arrStr, " ", "\n", -1)
	fmt.Println(arrStr)
}

C++: #include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	int a[10];
	int ans;
	int max1 = 0;
	int max2 = 0;
	int max3 = 0;
	int j;
	for (int i = 0; i < 10; i++){
		cin >> a[i];
	}
	for (int b = 0; b < 3; b++){
		for (int i = 0; i < 10; i++){
			if (max1 < a[i]){
				max1 = a[i];
				j = i;
			}

		}
		cout << max1 << endl;
		max1 = 0;
		a[j] = 0;
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef vector<int> VI;
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )

int main() {
    int tmp;
    VI heights;
    while (cin >> tmp) {
        heights.push_back(tmp);
    }
    sort(heights.begin(), heights.end(), [](int a, int b){return a > b;});
    
    REP(i, 0, 3) {
        cout << heights[i] << endl;
    }
    
    return 0;
}

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

int main()
{
    std::vector<int> array_mount;

    for ( int i = 0; i < 10; i++ )
    {
        int tmp = 0;
        std::cin >> tmp;
        array_mount.push_back(tmp);
    }

    std::sort( array_mount.begin(), array_mount.end(), std::greater<int>() );

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

    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];
    }
    for(int i=0;i<10;++i){
        int j=i;
        int tmp=a[i];
        while (j>=1 && a[j]<a[j-1])
            {
                tmp=a[j-1]; a[j-1]=a[j];a[j]=tmp;
                --j;
            }
    }
        cout << a[9] << endl;
        cout << a[8] << endl;
        cout << a[7] << endl;
}

C++: #include<iostream>
#include<algorithm>
 
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<<a[8]<<endl<<a[7]<<endl;
 
}

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

int a[4];

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

C++: #include<iostream>
using namespace std;
int main() {
	typedef unsigned short int mew;
	mew mountain[10];
	for (int i = 0; i < 10; i++) {
		cin >> mountain[i];
	}

	mew taller[3];
	mew a, b, c;

	a = mountain[0];
	b = mountain[1];
	c = mountain[2];

	for (int y = 3; y <= 9; y++) {
		if (a<=b){
			if (a<=c){
				if (a < mountain[y]) {
				???a = mountain[y];}
			}
			else{
				if (c < mountain[y]) {
					c = mountain[y];}
			}
		}
		else if (b<=c)
		{
			if (b < mountain[y]) {
				b = mountain[y];}
		}
	}

	//biggest->taller[0],bigger->taller[1],taller[2]
	{
		if (a >= b&&a >= c)
		{
			taller[0] = a;
			if (b >= c)
			{
				taller[1] = b;
				taller[2] = c;
			}
			else {
				taller[1] = c;
				taller[2] = b;
			}
		}
		if (b >= a&&b >= c)
		{
			taller[0] = b;
			if (a >= c)
			{
				taller[1] = a;
				taller[2] = c;
			}
			else {
				taller[1] = c;
				taller[2] = a;
			}
		}
		if (c >= b&&c >= a)
		{
			taller[0] = c;
			if (b >= a)
			{
				taller[1] = b;
				taller[2] = a;
			}
			else {
				taller[1] = a;
				taller[2] = b;
			}
		}
	} 

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

	return 0;
}

C++: ///
// File:  0001.cpp
// Author: ymiyamoto
//
// Created on Sat Nov  4 15:34:23 2017
//

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>

using namespace std;

int32_t main()
{
  vector<uint32_t> heights(10);

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

  sort(heights.begin(), heights.end());

  cout << heights[heights.size() - 1] << endl;
  cout << heights[heights.size() - 2] << endl;
  cout << heights[heights.size() - 3] << endl;

  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

vector< int > adj;

int main()
{
    for(int i = 1; i <= 10; i++){
        int x;
        cin>> x;
        adj.push_back(x);
    }
    sort(adj.begin(), adj.end());
    cout<< adj[9] <<'\n' << adj[8] <<'\n' << adj[7];
}

C++: #include<iostream>
using namespace std;
void main()
{
	int h[10];
	int i,j,t;
	for(i=0;i<10;i++)
	cin>>h[i];
	for(j=0;j<3;j++)
	{
		for(i=j+1;i<10;i++)
	   {
		 if(h[j]<h[i])
	     {
	     	t=h[j];
	        h[j]=h[i];
	        h[i]=t;
	     }
	   }
	   cout<<h[j]<<endl;
	}
}

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

int main() {
	// your code goes here
	int a[10];

for (int i = 0; i<10; ++i)
{
 scanf("%d",&a[i]);
}
sort(a,a+10);
printf("%d\n",a[9]);
printf("%d\n",a[8]);
printf("%d\n",a[7]);
	 return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main( void )
{
	vector <int> heights;
	for ( int i = 0; i < 10; i++ )
	{
		int height;
		cin >> height;
		heights.push_back( height );
	}

	sort( heights.rbegin(), heights.rend() );

	for ( int i = 0; i < 3; i++ )
	{
		cout << heights.at(i) << endl;
	}

	return 0;
}

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

int main(void){
	int x[10],top[3];
	int i;

	for(i=0;i<3;i++){
		top[i] = 0;
	}
	for(i=0;i<10;i++){
		std::cin >> x[i];
		if(top[0] < x[i]){
			top[2] = top[1];
			top[1] = top[0];
			top[0] = x[i];
		}else if(top[1] < x[i]){
			top[2] = top[1];
			top[1] = x[i];
		}else if(top[2] < x[i]){
			top[2] = x[i];
		}
	}

	std::cout << top[0] << "\n" << top[1] << "\n" <<top[2] << "\n";
	return 0;
}

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

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

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

int main(void) {
    vector<int> hill(10, 0);
    for (int i = 0; i < 10; i++) {
        cin >> hill[i];
    }
    sort(hill.begin(), hill.end(),greater<int>());
    for (int i = 0; i < 3; i++) 
        cout << hill[i] << endl;
    return 0;
}

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<bits/stdc++.h>
using namespace std;

int main(){
	vector<int>s(10);
	for(int a=0;a<10;a++)cin>>s[a];
	sort(s.begin(),s.end());
	cout<<s[9]<<endl;
	cout<<s[8]<<endl;
	cout<<s[7]<<endl;
	}