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>			//std::cout, std::cin
#include <string>			//std::string,std::to_string(C++11)
#include <vector>			//std::vector
#include <valarray>			//std::valarray
#include <algorithm>		//std::sort
#include <ctime>			//localtime_s
#include <cstdlib>			//abs
#include <cmath>			//abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <fstream>			//std::ifstream,std::ofstream
#include <iomanip>			//std::setprecision,std::setw,std::setfill
#include <random>			//std::random(C++11)
#include <numeric>			//std::accumulate
#include <functional>		//std::greater
#include <chrono>			//std::chrono(C++11)
#include <bitset>			//std::bitset
#include <queue>			//std::queue

const static double	de_PI	= 3.14159265358979323846;
const static int	de_MOD	= 1000000007;
const static int	de_MAX	= 999999999;

int main(void) {

	//std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());
	//std::ofstream ofs("456.csv");
	//std::chrono::system_clock::time_point t_st = std::chrono::system_clock::now();

	std::vector<int> A(10);
	for (int i = 0; i < 10; i++) {
		std::cin >> A[i];
	}
	std::sort(A.begin(), A.end());
	std::cout << A[9] << std::endl;
	std::cout << A[8] << std::endl;
	std::cout << A[7] << std::endl;

	//std::chrono::system_clock::time_point t_ed = std::chrono::system_clock::now();
	//std::cout << std::chrono::duration_cast<std::chrono::milliseconds>(t_ed - t_st).count() << "ms" << std::endl;

}

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

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

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

int main(){
    int n[10];
    int temp = 0;
	for (int i = 0; i < 10; i++) {
		cin >> n[i];
	}
	for (int i = 0; i < 10; i++) {
	    for (int j = i; j < 10; j++) {
            if(n[j] > n[i]){
                temp = n[i];
                n[i] = n[j];
                n[j] = temp;
            }
	    }
	}
	for (int i = 0; i < 3; i++) {
		cout << n[i] << endl;
	}

    return 0;
}

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

using namespace std;

int main(){
  vector<int> a(10, 0);
  for (int i = 0; i < 10; i++){
    cin >> a[i];
  }
  sort(a.begin(), a.end(), greater<int>());
  cout << a[0] << endl << a[1] << endl << a[2] << endl;
}

C++: #include <cstdio>

int m[16];

int main()
{
  for(int i=0;i<10;i++)
    scanf("%d", m+i);

  for(int i=0;i<3;i++){
    int idx = 0;
    for(int j=0;j<10;j++)
      if(m[idx] < m[j]) idx = j;

    printf("%d\n", m[idx]);
    m[idx] =  -1;
  }
  return 0;
}

C++: #include <iostream>
#include <array>
#include <algorithm>
 
int main(void) {
    std::array<u_int, 10> heights;
	//??\???
    for (u_int i = 0; i < 10; ++i) {
        std::cin >> heights[i];
    }
	//?????????
    std::sort(heights.begin(), heights.end(), std::greater<u_int>());
	//??????
    for (u_int i = 0; i < 3; ++i) {
        std::cout << heights[i] << std::endl;
    }
    return 0;
}

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;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a[10],i,j,highest=0,higher=0,higher2=0;
	for(i=0;i<10;i++){
		cin>>a[i];
	}
	for(i=0;i<10;i++){
		if(a[i]>highest){
			highest=a[i];
		}
	}
	cout<<highest<<endl;
	for(j=0;j<10;j++){
		if(highest==a[j]){
			a[j]=0;
			break;
		}
	}
	for(i=0;i<10;i++){
		if(a[i]>higher2){
			higher2=a[i];
		}
	}
	cout<<higher2<<endl;
	for(j=0;j<10;j++){
		if(higher2==a[j]){
			a[j]=0;
			break;
		}
	}
	for(i=0;i<10;i++){
		if(a[i]>higher){
			higher=a[i];
		}
	}
	cout<<higher<<endl;
}

C++: #include<stdio.h>

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

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

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

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

using namespace std;

int main()
{
	vector<int> v(10);
	for(int i=0; i<10; i++) cin >> v[i];
	sort(v.begin(), v.end(), std::greater<int>());
	for(int i=0; i<3; i++) printf("%d\n", v[i]);
}

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

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

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

int main(void) {
    std::priority_queue<u_int> heights;
    //??\???
    for (u_int h, i = 0; i < 10; ++i) {
        std::cin >> h;
        heights.push(h);
    }
	//??????
    for (u_int i = 0; i < 3; ++i) {
        std::cout << heights.top() << std::endl;
        heights.pop();
    }
    return 0;
}

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

C++: #include<stdio.h>

int main(){
    int i,j,hight[10],first=0;
    for(i=0;i<10;i++){
        scanf("%d",&hight[i]);
    }
    for(j=0;j<3;j++){
        for(i=j+1;i<10;i++){
            if(hight[j]<hight[i]){
                first=hight[j];
                hight[j]=hight[i];
                hight[i]=first;
            }
        }
    }   
    printf("%d\n%d\n%d",hight[0],hight[1],hight[2]);
}

C++: #include<iostream.h>
#include<conio.h>

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

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

using namespace std;

int main(){
	vector<int> v;
	for( int i=0; i<10; i++)
	{
		int n;
		cin>>n;
		v.push_back(n);
	}
	
	sort( v.begin(), v.end(), greater<int>() );

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

	return 0;
}