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<iostream>
#include<vector>
#include<algorithm>
int main(void){
std::vector<int> h;
int tmp;
while(std::cin>>tmp){
h.push_back(tmp);
}
std::sort(h.begin(),h.end());
std::remove_if(h.begin(),h.end(),[](int x) { return x>=10000; });

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

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
    int m[10];
    for(int i=0;i<10;i++)cin>>m[i];
    sort(m,m+10);
    reverse(m,m+10);
    for(int i=0;i<3;i++)cout<<m[i]<<endl;
}
//swap(a,b);
//max(a,b);
//min(a,b);
//sort(a,a+5);

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

using namespace std;
            
int main(){

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

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

int main() {
	multiset<int, greater<int>> ms; int temp;
	for (int i = 0; i < 10; i++) {
		cin >> temp; ms.insert(temp);
	}
	multiset<int, greater<int>>::iterator itr = ms.begin();
	for (int i = 0; i < 3; i++, ++itr) {
		cout << *itr << endl;
	}
	return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a, b, max = 0, max2 = 0, max3 = 0;
	for (a = 1; a <= 10; a++) {
		scanf("%d",&b);
		if (b > max) {
			max = b;
		}
		else if (b > max2) {
			max2 = b;
		}
		else if (b > max3) {
			max3 = b;
		}
	}
		printf("%d\n%d\n%d\n", max, max2, max3);
		return 0;
}

C++: #include<stdio.h>
#define ARRAY_SIZE 10
#define MAX_VALUE 10000
#define MIN_VALUE 0

int searchMax();
int *heightList;

int main(void){
  heightList = new int[ARRAY_SIZE];

  for(int i = 0;i < ARRAY_SIZE;i++){
    scanf("%d",&heightList[i]);
    printf("\ncount %d ; %d\n",i,heightList[i]);
    if(heightList[i] < MIN_VALUE || heightList[i] > MAX_VALUE){
      heightList[i] = 0;
    }
  }
  for(int i = 0;i < 3;i++){
    printf("%d\n",searchMax());
  }

  delete(heightList);

  return 0;
}

int searchMax(){
  int maxValue = -1;
  int index = -1;

  for(int i = 0;i < ARRAY_SIZE;i++){
    if(maxValue < (heightList[i])){
      maxValue = (heightList[i]);
      index = i;
    }
  }

  if(index != -1){
    (heightList[index]) = 0;
  }
  else{
    return -1;
  }

  return maxValue;
}

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 = i + 1 ; j < 10 ; j++)
    {
      if(height[i] < height[j])
        {
          int dumy = height[i];
          height[i] = height[j];
          height[j] = dumy;
        }
    }
    }
  for(int i = 0 ; i < 3 ; i++)
    {
      cout << height[i] << endl;
    }
  return 0;
}

C++: #include<iostream>
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++: #include <iostream>
#include <list>
using namespace std;

int main(){

	list<int> height;
	int h;

	for(int i=0;i<10;++i){
		cin>>h;
		height.push_back(h);
	}

	height.sort();

	list<int>::iterator it=height.end();
	
	--it;
	for(int i=0;i<3;++i){
		cout<<*it<<"\n";
		--it;
	}

    return 0;
}

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

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