Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	counter := 0
	var mountain []int
	for scanner.Scan() {
		i, err := strconv.Atoi(scanner.Text())
		if err != nil {
			break
		}
		mountain = append(mountain, i)
		counter++
		if counter == 10 {
			break
		}

	}
	sort.Ints(mountain)
	fmt.Println(mountain[9])
	fmt.Println(mountain[8])
	fmt.Println(mountain[7])
}

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

using namespace std;

#define REP(i, n) for(int i = 0; i < n; i++)
#define ALL(a) (a).begin(),(a).end()

int main() {
    vector<int> a(10);
    REP(i, 10) cin >> a[i];
    sort(ALL(a), greater<int>());
    REP(i, 3) cout << a[i]<< endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
	int a,mountain[10],j,k;
	for(int i=0;i<10;i++){
		cin>>mountain[i];
	}
	for(j=0;j<10;j++){
		for(k=0;k<10-j;k++){
			if(mountain[k]<mountain[k+1]){
				a=mountain[k];
				mountain[k]=mountain[k+1];
				mountain[k+1]=a;
			}
		}
	}
	cout<<mountain[0]<<"\n"<<mountain[1]<<"\n"<<mountain[2]<<"\n";
	return 0;
}

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

using namespace std;

int main(){
	int hills[10];
    
    for(int i=0;i<10;i++)cin >> hills[i];
    
	partial_sort( hills, hills + 3, hills+10, greater<int>() );
    
    for(int i=0;i<3;i++)　cout << hills[i] <<endl;
    
	return 0;
}

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

int main() {
	int height;
	std::vector<int> heights;

	while (std::cin >> height) {
		heights.push_back(height);
	}
	std::sort(heights.begin(), heights.end());
	std::reverse(heights.begin(), heights.end());
	for (int i = 0; i < 3; ++i) {
		std::cout << heights.at(i) << std::endl;
	}

	return 0;
}

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

int main(){
	std::vector<int >data;
	for (int i = 0; i <10; i++){
		data.push_back(i);
		std::cin>>data[i];
	}
	std::sort(data.begin(), data.end(),std::greater<int>());
	for (int j = 0; j < 3; j++)
		std::cout << data[j] << std::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<cstdio>
using namespace std;

int main(){

	int hill[]={0,0,0,0,0,0,0,0,0,0};

	for(int j=0;j<=9;j++){
		scanf("%d",&hill[j]);
	}

	int key;

	//sort
	for(key=9;key>=0;key--){

		for(int i=0;i<=key;i++){
			if(hill[i]>hill[i+1]){
				swap(hill[i],hill[i+1]);
			}
		}

	}

	printf("%d\n%d\n%d\n",hill[9],hill[8],hill[7]);

	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 i = 0; i < 10; i++) {
        for (int j = 0; j < i; j++) {
            if (height[j] < height[i]) {
                int temp = height[j];
                height[j] = height[i];
                height[i] = temp;
            }
        }
    }

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

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

int main()
{   
       int D[10]; 
       int i,k;
      
       
       for(i=1; i<=10; i++)
             {
             cin>>D[i];
             }
             sort(D,D+10);
             reverse(D,D+10);
             
       for(k=1; k<=3; k++)
       {
                cout <<D[k]<<endl;
                }
      
       
    
     return 0;
}

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

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int sum[10];
  int  i;
  for(i = 1; i <= 10 ;i++){
  cin >> sum[i];
  }
  sort(sum,sum+10);
  for(i = 9 ; i > 6;i--){
    cout << sum[i] << endl;
  }
    return 0;
  }

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

int main()
{
    std::set< int, std::greater<int> > s;
    for (int i = 0; i < 10; ++i) {
        int h;
        std::cin >> h;
        s.insert(h);
    }
    std::set< int, std::greater<int> >::iterator it = s.begin();
    for (int i = 0; i < 3; ++i)
        std::cout << *it++ << std::endl;
}

C++: #include<stdio.h>
int main()
{
long long a[11],i,temp,j,k,n=10;
for(i=0;i<10;i++)
{
scanf("%lld",&a[i]);
}
for(j=0;j<n-1;j++)
	{
	for(k=0;k<n-1;k++)
	{
	if(a[k+1]<a[k])
	{
	temp=a[k+1];
	a[k+1]=a[k];
	a[k]=temp;
	}
	}
}
for(i=9;i>6;i--)
{
printf("%lld\n",a[i]);
}
return 0;
}

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

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

 for(int i=0; i<3; i++){
  int n = h[0];
  int m = 0;
  for(int j=1; j<10; j++)
   if(n < h[j]){
    n = h[j];
    m = j;
   }
  cout << n << '\n';
  h[m] = -1;
 }

 return 0;
}

C++: #include <stdio.h>

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

  for(i=0;i<10;i++){
    scanf("%d", &height[i]);
  }
  
  for(i=0;i<9;i++){
    for(j=i+1;j<9;j++){
      if(height[i] <= height[j]){
	tmp = height[i];
	height[i] = height[j];
	height[j] = tmp;
      }
    }
  }

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

  return 0;
}

C++: 
#include<iostream>
using namespace std;
#define NUM 10	// ?±±?????°
#define TOP 3	// ??????TOP?????????????????????

int main(){
	int hight[NUM];	// ??\????????????
	int top[TOP];

	// ?????????????????????
	for(int i=0; i < NUM ; ){
		cin >> hight[i];
		// ?????¶ : 0 <= ?±±????????? <= 10000
		if(hight[i] < 0  ||  hight[i] > 10000){
			continue;
        }
        i++;
	}
    
	// ?????????????????????TOP???????????????
	top[0] = 0;
	for(int i=0; i < NUM ; i++){
		for(int j=0;j<TOP ; j++){
			// ???????????????????????????????????°???hight[i]???top[j]?????????????????\?????????
			if(hight[i] > top[j]){
				for(int k=TOP-1 ; k > j ; k--){
					top[k] = top[k-1];  // <- ????????§?????°?????????
				}
				top[j] = hight[i];
                break;
			}
		}
	}

	// ?????????TOP???????????????
	for(int i=0; i < TOP ; i++ ){
		cout << top[i] << '\n';
	}

	return 0;
}

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

int main()
{
    int x[10];
    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<iostream>
#include<algorithm>
using namespace std;
int main(){
int h[10];
int i;
for(i=0;i<10;i++)cin>>h[i];
sort(h,h+10);
for(i=0;i<3;i++)cout<<h[i]<<endl;
return 0;
}

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

using namespace std;

int high[10];

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

	sort(high, high + 10);

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