Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; 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++: #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;
}

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

int main(){
    int x;
    int h[3];
    for(int a=0;a<10;a++){
        cin >> x;
        if(x>h[0]){
            h[2] = h[1];
            h[1] = h[0];
            h[0] = x;
        }else if(x>h[1]){
            h[2] = h[1];
            h[1] = x;
        }else if(x>h[2]){
            h[2] = x;
        }
    }
    cout >> h[0] >> "\n" h[1] >> "\n" h[2] >> "\n";
    return 0;
}

C++: #include <iostream>

using namespace std;

void buble_sort(int high[]){
    int i,j,v,k;

    for(i = 0;i < 9;i++){
        v = i;
        for(j = i;j <= 9;j++){
            if(high[v] < high[j]){
                v = j;
            }
        }
        int box = high[i];
        high[i] = high[v];
        high[v] = box;

    }
}

int main() {
    int i,high[10];

    for (i = 0;i <= 9;i++){
        cin >> high[i];
    }

    buble_sort(high);

    cout << endl;

    for(i = 0;i <= 2;i++){
        cout << high[i];
        if(i != 2){
            cout << ' ';
        }
        else {
            cout << endl;
        }
    }

    return 0;
}

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

int main() {
	multimap<int, greater<int>> mp; int temp; int c = 0;
	while (cin >> temp) { mp[c] = temp; c++; }
	for (int i = 0; i < 3; i++) cout << mp[i] << endl;
	return 0;
}

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

using namespace std;

int main (void){
    int mountain_height[10];
    for (int i = 0; i < 10; i++) cin >> mountain_height[i];
    sort(&mountain_height[0],&mountain_height[0]+10,std::greater<int>());
    for (int i = 0; i < 3; i++) cout << mountain_height[i] << endl;
}

C++: #include<stdio.h>
int main(void){
	int i;
	int a[10];
	int x=0, y=0, z=0;
	
	for(i=0;i<10;i++){
		do{
			printf("山の高さ%d(整数)",i+1);
			scanf("%d",&a[i]);
		}while(a[i]<0||10000<a[i]);
		
		if(a[i]>x){
			z=y;
			y=x;
			x=a[i];
		}
		else if(a[i]>y){
			z=y;
			y=a[i];
		}
		else if(a[i]>z){
			z=a[i];
		}
	}
	
	printf("%d\n%d\n%d\n",x,y,z);
	
	return 0;
}

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

C++: #include <iostream>
#include <string>
using namespace std;
 
int main(){
int rank[3],a[10],i = 0,ii = 0;
rank[0] = 0;
rank[1] = 0;
rank[2] = 0;
while(i <= 9){
	cin >> a[i];
	while(ii <= 2){
		if(rank[ii] < a[i]){			
			if(ii == 0){			
			rank[2] = rank[1];
			rank[1] = rank[0];
			rank[0] = a[i];
			if(ii == 1){
			rank[1] = rank[0];
			rank[0] = a[i];
			}
			if(ii == 2)
			rank[2] = a[i];
			}
			break;	
		}
		ii++;
	}
i++;
ii = 0;

}
cout<<rank[0]<<endl<<rank[1]<<endl<<rank[2]<<endl;




}

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

C++: N = 10
a = []
for i in range(N):
    a.append(input()) # ３度の入力に対して、1, 2, 3 と入力。
print(a) # ['1', '2', '3']

C++: #include<iostream>
#include<algorithm>
main(){int a[10],i;for(i=0;i<10;i++)std::cin>>a[i];std::sort(a,a+10);std::cout<<a[9]<<a[8]<<a[7]<<"\n";}

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

int main()
{
    int first = 0;
    int second = 0;
    int third = 0;
    std::array<int, 10> arr;

    for (int i = 0; i < 10; i++) {
        std::cin >> arr.at(i);
        if (arr.at(i) >= first) {
            third = second;
            second = first;
            first = arr.at(i);
        } else if (arr.at(i) >= second) {
            third = second;
            second = arr.at(i);
        } else if (arr.at(i) >= third) {
            third = arr.at(i);
        }
    }

    std::cout << first << std::endl
              << second << std::endl
              << third << std::endl;
    return 0;
}

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

using namespace std;

int main()
{
	int buf;
	priority_queue<int> qu;

	for ( int i = 0; i < 10; i++ )
	{
		cin >> buf;
		qu.push( buf );
	}

	for ( int i = 0; i < 3; i++ )
	{
		printf("%d\n", qu.top() );
		qu.pop();
	}

	return 0;
}