Go: package main

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

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

	sort.Slice(mountHeightList, func(i, j int) bool { return mountHeightList[i] > mountHeightList[j] })

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

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

int main(){
	int mt[10];
	for(int i = 0; i < 10; i++)
		cin >> mt[i];
	for(int i = 0; i < 3; i++){
		for(int j = i + 1; j < 10; j++){
			if(mt[i] < mt[j]){
				int z = mt[i];
				mt[i] = mt[j];
				mt[j] = z;
			}
		}
	}

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

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

using namespace std;

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

C++: #include<iostream>
#include <vector>
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define REPI(i,a,b) for(int i=(int)a;i<(int)b;++i)
using namespace std;

void solver() {
    vector<int> m;
    REP(i,10){
        int n;
        cin>>n;
        m.push_back(n);
    }
    sort(m.begin(),m.end(),greater<int>());
    REP(i,3){
        cout<<m[i]<<endl;
    }
}

int main() {
    solver();
}

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

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

int main(){
  multiset<int> m;
  int a;
  for(int i=0; i<10; i++){
    cin >> a;
    m.insert(a);
  }

  multiset<int>::reverse_iterator it = m.rbegin();
  for(int i=0; i<3; i++)
    cout << *it++ << endl;

  return 0;
}

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

#define times(n, i) uptil(0, n, i)
#define upto(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i <= _##i poi i++)
#define uptil(f, t, i) for(auto _##i = (t), i = decltype(_##i)(f) poi i < _##i poi i++)
#define downto(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i >= _##i poi i--)
#define downtil(f, t, i) for(auto i = (f), _##i = decltype(i)(t) poi i > _##i poi i--)

#define unless(c) if(!(c))
#define until(c) while(!(c))
#define loop while(true)

#define poi ;
#define poipoi << "\n"

using namespace std;

int main(){
	vector<int> pyon(10) poi
    times(10, i) cin >> pyon[i] poi
    sort(pyon.begin(), pyon.end(), greater<int>()) poi
    times(3, i) cout << pyon[i] poipoi poi
    return 0 poi
}

C++: #include<stdio.h>
const int N = 15;
int main()
{
	int a[N] = {0};
	for(int i = 0; i < 10; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i < 10; i++)
	{
		
		for(int j = i; j < 10; j++)
		{
			if(a[i] < a[j])
			{
				int tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	} 
	for(int i = 0; i < 3; i++)
	{
		printf("%d\n", a[i]);
	}
	return 0;
}

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