Go: package main

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

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

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

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

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;

        char c_
        cin>>c_

	return 0;
}

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

using namespace std;

int main(){

	vector<int> mountains;
	
	for(int i= 0 ; i<10 ; i++){
		int a;
		cin>>a;
		mountains.push_back(a);
	}

	for(int i=0 ; i<mountains.size()-1 ; i++){
		for(int j=0 ; j<mountains.size()-1 ; j++){
			if(mountains[j] < mountains[j+1]){
				int tmp;
				
				tmp = mountains[j];
				mountains[j] = mountains[j+1];
				mountains[j+1] = tmp;
			}
		}
	}

	for(int i ; i<3 ; i++){
		cout<<mountains[i]<<endl;
	}

return 0;
}

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

int main(){
	int n,j,v;
	int a[10];

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

	for(int i=1;i<n;i++){
		int v = a[i];
		int j=i-1;
		while(j>=0 && a[j]>v){
			a[j+1]=a[j];
			j--;
		}
		a[j+1]=v;
	}

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


    return 0;
}

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

int main(){
	int height[10];
	for (int i=0;i<10;i++){
		cin >> height[i];
	}
	for (int h = 0;h<9;h++){
	for (int i=0;i<9;i++){
		if (height[i]<height[i+1]){
			int a;
			a = height[i];
			height[i]=height[i+1];
			height[i+1] = a;
		}
	}
	}
	for (int i =0;i<3;i++){
		cout << height[i] <<endl;
	}
    return 0;
}

C++: #include<stdio.h>

int main()
{
	int height[10], i;
	for (i = 0; i < 10; i++)
	{
		scanf("%d", &height[i]);
	}
	int n1 = 0, n2 = 0, n3 = 0, l, m, s;
	for (i = 0; i < 10; i++)
	{
		if (n1 < height[i])
		{
			n1 = height[i];
			l = i;
		}
	}
	for (i = 0; i < 10; i++)
	{
		if ((n2 < height[i]) && (i != l))
		{
			n2 = height[i];
			m = i;
		}
	}
	for (i = 0; i < 10; i++)
	{
		if ((n3 < height[i]) && (i != l) && (i != m))
		{
			n3 = height[i];
			s = i;
		}
	}
	printf("%d\n%d\n%d\n", n1, n2, n3);
	return 0;
}

C++: #include <iostream>
//#include <fstream.h>
//#include <cstring>
using namespace std;

int main() {
  
  int n[10];
  int temp,i,j;

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

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

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

  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(rbegin(a), rend(a));
	for (int i = 0; i != 3; ++i)
		cout << a[i] << endl;
	return 0;
}

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

int main() {
	int height[10];
	int tmp;
	int i=0,j=0;

	for (;i<10;i++)
		cin>>height[i];
	for (i=0;i<100;i++)
		for(j=1;j<10;j++)
			if (height[j-1]<height[j]) {
				tmp = height[j-1];
				height[j-1] = height[j];
				height[j] = tmp;
			}

	for (i=0;i<3;i++)
		cout<<height[i]<<endl;
	return 0;
}

C++: #include<stdio.h>
          
int main(void){
    /* 宣言と初期化 */
    int hai[10];
    int id[2];
    int i;
    int temp2nd;
    int temp3rd;
    int tempmax;
          
for(i=0;i<10;i++)
{
scanf("%d",&hai[i]);
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0];
    /* 計算 */
    for(i=0;i<10;i++){
        /* 最大値求める */
        if(hai[i]>tempmax)
       {tempmax=hai[i];id[0]=i;}
    }
    for(i=0;i<10;i++){
        /*2番目求める */
        if(hai[i]<tempmax&&hai[i]>temp2nd&& i != id[0])
        {temp2nd=hai[i];id[1]=i;}
    }  
    for(i=0;i<10;i++){
        /* 3番目求める */
        if(hai[i]>temp3rd&&hai[i]<temp2nd && i != id[1] && i != id[0])
       {temp3rd=hai[i];}
    }
          
    /* 表示 */
    printf("最も高い山の高さ　%d\n",tempmax);
    printf("２番目に高い山の高さ　%d\n",temp2nd);
    printf("３番目に高い山の高さ　%d\n",temp3rd);
          
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

int main(void) {
	int x=0;
	vector<int> data;
	for (int i = 0; i < 10; i++) {
		scanf("%d", &x);
		data.push_back(x);
	}
	sort(data.begin(), data.end(), greater<int>());
	for (int i = 0; i < 3; i++) {
		printf("%d\n", data[i]);
	}

	return 0;
}

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

int main(){
    int hest[3]={0,0,0};
    int h;
    for(int i=0;i<10;i++){
        std::cin>>h;
        for(int j=0;j<3;j++){
            if(hest[j]<h){
                hest[j] = h;
            }
        }
    }

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

    return 0;
}

C++: 
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	long long int arr[10];
	for (int i = 0; i < 10; i++)
	{
		scanf("%lld", &arr[i]);
	}
	int temp;
	for (int i = 0; i < 10; i++)
	{
		for (int j = i+1; j < 10; j++)
		{
			if(arr[i]<arr[j])
			{
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}
	for (int i = 0; i < 3; i++)
	{
		printf("%lld\n", arr[i]);
	}
	cin.get();
	return 0;
}

C++: #include<stdio.h>   

void func(float); 

int main(void) 
{
	float tai;
	
	while(scanf("%f",&tai)!=EOF)    { 
        	func(tai);
	}  
   	return 0;
}	 
	void func(float tai) 
	{     
	float lim[10]={48.0,51.0,54.0,57.0,60.0,64.0,69.0,75.0,81.0,91.0};   
  	char kai[11][13]={"light fly","fly","bantam","feather","light","light welter","welter","light middle","middle","light heavy","heavy"};    
 	int i;
       	
	for(i=0;i<10;i++)    {    
		if(lim[i]>=tai){  
			break;   
	      } 
	}     
	printf("%s\n",kai[i]);
}

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

int main()
{
  int mt[10];
  int high[3];
  int height;
  

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

  for(int i=0;i<3;i++)
    {
      high[i] = 0;
    }

  for(int i=0;i<10;i++)
    {
      if(mt[i]>=high[2])
	{
	  high[2] = mt[i];
	}
      if(mt[i]>=high[1])
	{
	  high[2] = high[1];
	  high[1] = mt[i];
	}
      if(mt[i]>=high[0])
	{
	  high[2] = high[1];
	  high[1] = high[0];
	  high[0] = mt[i];
	}
    }

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

  return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
const int    INF = 100000000;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef pair<int,int> P;

int main(){
	int x[10];
	rep(i,10) cin >> x[i];
	sort(x,x+10,greater<int>());
	rep(i,3) cout << x[i] << endl;
}