Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

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;
		}
		else {

		}
	}
	printf("%d\n %d\n %d\n", max, max2, max3);

}

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.begin(),h.end());
	
	for(int i = 0; i < 3; i++){
		cout << h[i] << endl;
	}
	
    return 0;
}

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

int main() {
int top[5]={0,0,0,0,0};
int yama;

cin >> top[0];

for(int i=0; i<9; i++){
 cin >> yama;

 for(int j=0; j<3; j++){
  if(yama >top[j]){
   top[j+2] = top[j+1];
   top[j+1] = top[j];
   top[j] =yama;
   break;
  }
 }
 return 0;
}

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

int main() {
	int i,a[10];
	for (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>
#include <algorithm>
using namespace std;

int main(){
    vector<int> v(10);
    int index = 0;  
    for(int i = 0; i< 10; i++){
        cin >> v[i];
    }
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
}

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

int main()
{
	int m[10];
	int i, j, n;
	for(i=0; i<10; i++)
		cin >> m[i];

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

	cout << "output" << endl;
	for(i=0; i<3; i++)
		cout << m[i] << endl;
}

C++: #include<stdio.h>
int main()
{
	int top[3]={0};
	for(int i=0;i<10;i++)
	{
		int temp;
		scanf("%d",&temp);
		if(temp>top[0])
		{
			top[2]=top[1];
			top[1]=top[0];
			top[0]=temp;
		}
		else if(temp>top[1])
		{
			top[2]=top[1];
			top[1]=temp;
		}
		else if(temp>top[2])
		{
			top[2]=temp;
		}
	}
	printf("%d\n%d\n%d\n",top[0],top[1],top[2]);
}

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

int main(){
    int a[10]={0};
    int temp;
    for(int i=0;i<10;i++){
        cin>>a[i];
    }
    int i=0;
    for(int j=0;j<=8;j++)
        for(i=0;i<=8;i++)
            if(a[i]<a[i+1]){
                temp=a[i];
                a[i]=a[i+1];
                a[i+1]=temp;
                }
    cout<<a[0]<<endl;
    cout<<a[1]<<endl;
    cout<<a[2]<<endl;        
    return 0;
}

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



using namespace std;

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

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

using namespace std;

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

C++: #include <iostream>
#include <algorithm>
#include <stdio.h>
#define pri(dt) printf("%d\n",dt)
#define RPE0(loopTotal)  for(int i=0;i<=(loopTotal);i++)
#define RPE(loopTotal)  for(int i=1;i<=(loopTotal);i++)

int data[9];

using namespace std;
int main(void){
    
    RPE0(9) scanf("%d",&data[i]);
    sort(data,data+9,greater<int>());
    RPE0(2) pri(data[i]);

}

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);
	cout << h[9] << endl << h[8] << endl << h[7] << endl;
}

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

using namespace std;

int main(void) 
{
    int i;
    int hs[10];

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

    sort(hs, hs+10, greater<int>());

    for (i = 0; i < 3; i++) {
        cout << hs[i] << "\n";
    }

    return 0;
}

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

int main()
{
	std::vector<int> input;
	std::copy(
		std::istream_iterator<int>(std::cin),
		std::istream_iterator<int>(),
		std::back_inserter(input));

	std::partial_sort(input.begin(), input.begin() + 3, input.end(), std::greater<int>());

	for (std::vector<int>::const_iterator i = input.begin(); i != input.begin() + 3; ++i) {
		std::cout << *i << "\n";
	}
	return 0;
}

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

using namespace std;

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

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

using namespace std;

int main(){

	priority_queue<int> pq;
	for(int i = 0; i < 10; i++){
		int tmp;
		cin >> tmp;
		pq.push(tmp);
	}

	for(int i = 0; i < 3; i++){
		cout << pq.top() << endl;
		pq.pop();
	}

	int x;
	cin >> x;

	return 0;
}

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

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

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

C++: #include <iostream>
using namespace std;
void swap_(int* a,int* b){
	int temp=*a;*a=*b;*b=temp;
}
int main(){
	int hight[10];
	for(int i=0;i<10;i++) cin >> hight[i];
	for(int i=1;i<=3;i++){
		for(int j=9;j>=i;j--){
			if(hight[j-1]<hight[j]) swap_(&hight[j],&hight[j-1]);
		};};
	for(int i=0;i<3;i++) cout << hight[i] << '\n' ;
}

C++: #include<stdio.h>

int main(){
	int i,j,k,nb=0,low=9,height[10];
	for(i=0;i<10;i++)
		scanf("%d",&height[i]);
	for(i=0;i<3;i++){
		for(j=0;j<10;j++){
			for(k=0;k<10;k++){
				if(height[j]>height[k])
					nb++;
			}
			if(nb==low){
				printf("%d\n",height[j]);
				low--;
				break;
			}
			nb=0;
		}
	}

	return 0;
}

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


int main(){
	int i,h[10];
	for(i = 0;i < 10;i++) scanf("%d",&h[i]);
	sort(h,h + 10);
	for(i = 0;i < 3;i++) printf("%d\n",h[i]);
	return 0;
}

C++: i = 0
while i < 10 do
 a[i] = gets
 i = i + 1
end

b = a.map(&:to_i).sort
puts b[0]
puts b[1]
puts b[2]

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

int main(void) {
    int height[10];
    
    for(int i = 0; i < 10; ++i) {
        cout << "No." << i + 1 << " : " << flush;
        cin >> height[i];
    }
    sort(height, height + 10);
    
    for(int i = 0; i < 3; ++i) {
        cout << height[9 - i] << endl;
    }
}