Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mt := make([]int, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mt[i])
	}

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

C++: //
//  main.cpp
//  ListOfHeights
//
//  Created by James Hosken on 28/09/2014.
//  Copyright (c) 2014 James Hosken. All rights reserved.
//

#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;

int main(int argc, const char * argv[])
{
    
    string input_line;
    
    int *heights;
    heights = new int[0];
    int lineNum = 0;
    
    
    while(cin)
    {
        getline(cin, input_line);
        lineNum++;
        
        //Chunk of array expansion code
        int line = atoi(input_line.c_str());
        int* temp = new int[lineNum];
        copy(heights, heights + lineNum-1, temp);
        delete [] heights;
        temp[lineNum-1] = line;
        heights = temp;
        
    }
    

    sort(heights, heights + lineNum);
    
    for(int i = lineNum-1; i >= lineNum-3; i--)
    {
        cout << heights[i] << endl;
    }

    
}

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

int main(){
    int height[10];
    
    for(int i=0;i<10;i++){
        do{
            cin >> height[i];
        }while(height[i]<0 || height[i]>10000);
    }
    
    sort(height,height+10);
    
    for(int i=9;i>6;i--)
        cout << height[i]<<endl;
    
    return 0;
}

C++: #include<stdio.h>

int main(){
	int m[10],i,j,big;
	for(i=0;i<10;i++){
		scanf("%d",&m[i]);
	}
	for(i=0;i<10;i++){
		for(j=0;j<10;j++){
			if(m[i]>m[j]){
				big=m[i];
				m[i]=m[j];
				m[j]=big;
			}
		}
	}
	for(i=0;i<3;i++){
		printf("%d\n",m[i]);
	}
	return 0;
}

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

using namespace std;

int main(){
  vector<int> v;
  for(int i = 0; i < 10; i++){
    int b;
    cin >> b;
    v.push_back(b);
  }
  sort(v.begin(), v.end(), greater<int>());
  cout << v[0] << endl << v[1] << endl << v[2] << endl;
}

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

int main(){

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

	for(int j=0;j<=9;j++){
		cin>>hill[j];
	}

	int key;
	int flag;

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

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

	}

	cout<<hill[9]<<"\n"<<hill[8]<<"\n"<<hill[7]<<endl;

	return 0;

}

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

int main()
{
	int x[10];
	int i,j,tmp;
	for(i=0;i<10;i++){
		cin >> x[i];
	}
	
	sort(x,x+10);
	
	cout <<x[9] <<endl;
	cout <<x[8] <<endl;
	cout <<x[7] <<endl;
    
    
    
	
	return 0;
}

C++: #include<iostream>

//関数の宣言
void sort(int mountain[10]);

int main(){
	
	const int a = 10;
	int mountain[a];
	
	for (int i = 0; i < 10; ++i){
		std::cin >> mountain[i];
	}
	sort(mountain);

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


//関数の定義
void sort(int mountain[10]){
	for (int i = 0; i < 9; ++i){
		for (int j =i+1; j < 10; ++j){
			if (mountain[i] < mountain[j]){
				int tmp = mountain[i];
				mountain[i] = mountain[j];
				mountain[j] = tmp;
			}
		}
	}
}

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

int main() {
/*	int a[3];
	cin >> a[0] ;
	a[1] = 3;
	a[2] = a[0] * 10;

	cout << a[0] <<" " << a[1] <<" "<< a[2] << endl;
	
	for (int i = 0; i < 3; i++) {
		cout << a[i] << endl;
	}


	sort(a,a+5);
*/
	int a[10];
	for (int i = 0; i < 10; i++) {
		cin >> a[i];
	}
	
	sort(a,a+10,greater<int>());

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

	return 0;
}

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

static void input(std::vector<int>& hills)
{
    int val = 0;
    
    if (0x00 == &hills) {
        std::cerr << "hills is null" << std::endl;
        exit (1);
    }
 
    while (std::cin >> val) {
        hills.push_back(val);
    }
}

static int getMax(std::vector<int>& hills)
{
    if (0x00 == &hills) {
        std::cerr << "hills is null" << std::endl;
        exit (1);
    }

    std::sort(hills.begin(), hills.end());
    int ret = hills.back();
    hills.pop_back();

    return ret;
}

int main()
{
    std::vector<int> vec;

    input(vec);
    for (int i = 0; i < 3; i++) {
        std::cout << getMax(vec) << std::endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int d[10];
  for(int i=0;i<10;++i){
    cin>>d[i];
  }
  sort(d,d+10,greater<int>());
   for(int i=0;i<3;++i){
     cout<<d[i]<<endl;
  }
  return 0;
}

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

int main(){
	vector<int> v;
	int a[10];
	for(int i = 0;i < 10;i++){
		cin >> a[i];
	}
	v.assign(&a[0], &a[10]);
	sort(v.begin(), v.end());
	for(int i = 9;i > 6;i--)cout << v[i] << endl;
    return 0;
}

C++: #include <iostream>
int main(void)
{
    int array[3] = {};
    int min = 0;
    int input;
    for(int i=0;i < 10;++i){
        std::cin >> input;
        if(i >= 3){
            if(array[min] < input){
                array[min] = input;
            }
            else{
                continue;
            }
        }
        else{
            array[i] = input;
        }
        min = array[0] < array[1] ? (array[0] < array[2] ? 0 : 2) : (array[1] < array[2] ? 1 : 2);
    }
    int max = array[0] > array[1] ? (array[0] > array[2] ? 0 : 2) : (array[1] > array[2] ? 1 : 2);
    std::cout << array[max] << std::endl;
    std::cout << array[3 - max - min] << std::endl;
    std::cout << array[min] << std::endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int a;
  int x=0;
  int y=0;
  int z=0;
  for(int i=1;i<=10;i++){
    cin >> a;
    if(a>=x){
      x=a;
    }else if(y<=a<=x){
      y=a;
    }else if(z<=a<=y){
      z=a;
    }
  }
  cout << x << endl;
  cout << y << endl;
  cout << z << endl;
}

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

int main() {
  int hill[10];
  for(int i=0;i < 10;i++) {
    cin >> hill[i];
  }
  sort(hill,hill + 10);
  cout << hill[9] << endl
       << hill[8] << endl
       << hill[7] << endl;
}

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

int main()
{
  int h1, h2, h3, n, tmp;
  h1 = h2 = h3 = 0;
  for(int i = 0; i < 10; i++){
    cin >> n;
    h1 = (i == 0) ? n : h1;
    h2 = (i == 1) ? n : h2;
    h3 = (i == 2) ? n : h3;
    if(h1 < h2){
      tmp = h1;
      h1 = h2;
      h2 = tmp;
    }
    if(h2 < h3){
      tmp = h2;
      h3 = h2;
      h2 = tmp;
    } 
    if(i > 2){
      if(n > h1){
	h3 = h2;
	h2 = h1;
	h1 = n;
      }else{
	if(n > h2){
	  h3 = h2;
	  h2 = n;
	}else{
	  if(n > h3){
	    h3 = n;
	  }
	}
      }
    }
  }
  cout << h1 << endl << h2 << endl << h3 << endl;
}

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

using namespace std;

int main()
{
	deque<int> nums;

	for( int i = 0; i < 10; i++ )
	{
		int in;
		cin >> in;
		nums.push_back( in );
	}
	
	
	sort( nums.begin(), nums.end(), greater<int>() );
	int cnt = 1;

	deque<int>::iterator it = nums.begin();
	while( it != nums.end() )
	{
		cout << *it << endl;
		++it;
		cnt++;
		if( cnt == 4 ) break;
	}

	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
     
int main(void){
    /* 宣言と初期化 */
    int hai[10];
    int id[2];
    int i;
    int temp2nd;
    int temp3rd;
    int tempmax;
              
for(i=0;i<10;i++)
{
   cin >> hai[i];
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0];
    /* 計算 */
for(int j=9;j>1;j--){
    for(i=0;i<j;i++){
        /* 最大値求める */
        if(hai[j]<hai[i])
       {tempmax=hai[i];
         hai[i]=hai[j];
         hai[j]=tempmax
        }
    }
    }

    /* 表示 */
    printf("%d\n",hai[9]);
    printf("%d\n",hai[8]);
    printf("%d\n",hai[7]);
              
    return 0;
}