Go: package main

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

var (
	n  = 10
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	heights := make([]int, n, n)
	for i := 0; i < n; 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++: #include <iostream>
using namespace std;
int main(){
  int h1=0,h2=0,h3=0,h;
  for(int i;i<10;++i){
    cin >> h;
    if(h>h1){
      h3=h2;
      h2=h1;
      h1=h;
    }else if(h>h2){
      h3=h2;
      h2=h;
    }else if(h>h3){
      h3=h;
    }
  }
  cout<<h1<<endl<<h2<<endl<<h3<<endl;
}

C++: #include<stdio.h>

int main(void)
{
	int high[10]={1819,2003,876,2840,1723,1673,3776,2848,1592,922};
	int x,max,time;


	for(time=1;time<=3;time)
	{
		max=0;

		for(x=0;x<10;x++)
		{
			if(max<high[x])
			{
				max=high[x];
			}
		}
		for(x=0;x<10;x++)
		{
			if(max==high[x])
			{
				printf("%d\n",high[x]);
				high[x]=0;
				time++;
			}
		}
	}

	return 0;
}

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

using namespace std;

int main() {
    array<int, 10> A;
    for (int i = 0; i < 10; ++i) {
        cin >> A[i];
    }

    sort(A.begin(), A.end(), std::greater<int>());

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

    return 0;
}

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

int main() {
    int m;
    list<int> mountain = list<int>();
    for (int i = 0; i < 10; i++) {
        scanf("%d", &m);
        mountain.push_back(m);
    }
    mountain.sort();
    for (int i = 0; i < 3; i++) {
        printf("%d\n", mountain.back());
        mountain.pop_back();
    }
    return 0;
}

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

int main(){
	
	int height[10] = {};

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

	int f = INT_MIN, s = INT_MIN, t = INT_MIN;

	for (int i = 0; i < 10; i++){
		if (height[i] >= t){
			t = height[i];
		}
		if (t >= s){
			swap(s, t);
		}
		if (s >= f){
		swap(f,s);
		}
	}
    
	cout << f << "\n" << s << "\n" << t << endl;

		return 0;
}

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

// List of Top 3 Hills(0001)
int main()
{
	vector<int> dat(10);
	for (int i = 0; i < 10; ++i)
		cin >> dat[i];

	sort(dat.begin(), dat.end(), greater<int>());
	
	for (int i = 0; i < 3; ++i)
		cout << dat[i] << endl;

	return 0;
}

C++: A = sorted([int(raw_input()) for _ in xrange(10)])
print A[9]
print A[8]
Print a[7]

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

int main(){
 int mountain,first=0,second=0,third=0;
 for(int i=0;i<10;i++){
  cin>>mountain;
  if(mountain>first){
   third=second;
   second=first;
   first=mountain;
  }else if(mountain>second){
   third=second;
   second=mountain;
  }else if(mountain>third){
   third=mountain;
  }
 }
 cout<<first<<'\n'<<second<<'\n'<<third;
 return 0;
}

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

int main()
{
	int height[10];
	int TopOfThree[3];

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

	for (int i = 0; i < 3; i++)
	{
		int index;
		TopOfThree[i] = height[0];
		for (int j = 1; j < 10 - i; j++)
		{
			if (TopOfThree[i] < height[j])
			{
				TopOfThree[i] = height[j];
				index = j;
			}
		}

		for (int k = index; k < 10 - i; k++)
		{
			if (k == 9 - i)
				height[k] = 0;
			else
				height[k] = height[k + 1];
		}
		cout << TopOfThree[i] << endl;
	}

	int i;
	cin >> i;

	return 0;
}

C++: /*
 * http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0002
 */
#include <iostream>
#include <sstream>

using namespace	std;

int
main()
{
	string line;
	while (getline(cin, line)) {
		int a, b;
		istringstream iss(line);
		ostringstream oss;
		iss >> a >> b;
		oss << a + b;
		cout << oss.str().length() << endl;
	}
}

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

int main(){
	int nyuryoku,high=0,low=0,middle=0,flag=0;
	
	for(int i=0;i<10;i++){
	cin>>nyuryoku;
	if(flag==0){
	high = nyuryoku;
	low = nyuryoku;
	middle = nyuryoku;
	flag++;
	}else{
	if(nyuryoku>low){
		if(nyuryoku>middle){
			if(nyuryoku>high){
				high = nyuryoku;
			}else
				middle = nyuryoku;
			}else
				low = nyuryoku;
		}
		}
	}
	cout<<high<<endl;
	cout<<middle<<endl;
	cout<<low<<endl;
return 0;
}

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


int main(void){

	int a[11],i,max1,max2,max3;

	for (int i=1; i<11; i++){
		while (true){ 
		cout << "山の高さ" << i << "（整数）" ;			
		cin >> a[i];
		if ((cin.good() == 1) && (a[i] >= 0) && (a[i] <= 10000)) {
			break;
		}
		}	
	}


	max1 = 0;
	max2 = 0;
	max3 = 0;

	for (i=1; i<11; ++i){
		if (a[max1] < a[i]){max1 = i;}
	}
		for (i=1;i<11;++i){
			if (a[i] <= a[max1]){
				if (a[max2] < a[i]){max2 = i;}
		}
		}
			for (i=1;i<11;++i){
			if (a[i] <= a[max2]){
				if (a[max3] < a[i]){max3 = i;}
		}
			}

		cout << a[max1] << endl;
		cout << a[max2] << endl;
		cout << a[max3] << endl;
		

		return 0;
	}

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

void quicksort(int x[10],int first,int last){
    int pivot,j,temp,i;

     if(first<last){
         pivot=first;
         i=first;
         j=last;

         while(i<j){
             while(x[i]>=x[pivot]&&i<last)
                 i++;
             while(x[j]<x[pivot])
                 j--;
             if(i<j){
                 temp=x[i];
                  x[i]=x[j];
                  x[j]=temp;
             }
         }

         temp=x[pivot];
         x[pivot]=x[j];
         x[j]=temp;
         quicksort(x,first,j-1);
         quicksort(x,j+1,last);

    }
}
int main()
{
    int i;
    int a[15];
    for(i=0;i<10;i++)
        scanf("%d",&a[i]);
    quicksort(a,0,9);

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

    return 0;
}

C++: #include<iostream>

#include<set>

int main(){
        std::multiset<int> st;
        int h;
        for(int i=0;i<10;i++){
                std::cin >> h;
                st.insert(h);
        }
        std::multiset<int>::reverse_iterator itr = st.rbegin();
        for(int i=0;i<3;i++){
                std::cout << *itr << std::endl;
                *itr++;
        }
        return 0;
}

C++: #include <stdio.h>

int height[10];

void scan(){
  for(int i = 0; i < 10; i++){
    scanf("%d", &height[i]);
  }
}

void sorting(){
    for(int numb = 0; numb < 9; numb++){
        for(int num = 0; num < 9-numb; num++){
            if(height[num] < height[num+1]){
                int stock = height[num];
                height[num] = height[num+1];
                height[num+1] = stock;
            }
        }
    }
}

int main(){
  scan();
  sorting();
  for(int a = 0; a < 3; a++){
    printf("Height%d: %d\n", a, height[a]); 
  }
  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 <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
int n;
using namespace std;
int main(){
	priority_queue <int > dp;

	while(cin>>n){
		dp.push(n);
	}
	for(int i=0;i<3;i++){
		int output=dp.top();
		dp.pop();
		cout<<output;
	}
	return 0;
}