Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; 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 num = 10;
    int Mountain[num];

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

    for( int i = 0; i < num; i++ )
    {
        for( int j = 0; j < num - 1; j++)
        {
            if(Mountain[j] < Mountain[j+1] )
                {
                    int tmp = 0;
                    tmp = Mountain[j];
                    Mountain[j] = Mountain[j+1];
                    Mountain[j+1] = tmp;
                }
        }
        
    }

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

    return 0;
}

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

int main(){
  std::vector<int> vec(10);
  for(int i = 0; i < 10; i++){
    std::cin >> vec[i];
  }
  std::sort(vec.begin(), vec.end(), std::greater<int>());
  for(int i = 0; i < 3; i++){
    std::cout << vec[i] << std::endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;

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

C++: #include<stdio.h>

int main(void){
	int i,j,k,l,x[10],highest,higher,high;
	for(i=0;i<10;i++){
		scanf("%d",&x[i]);
	}
	highest=0;
	higher=0;
	high=0;
	for(j=0;j<10;j++){
		if(x[j] > highest){
		highest=x[j];
	}
	}
	for(k=0;k<10;k++){
		if(x[k]>higher && highest > x[k]){
		higher=x[k];
	}
	}
	for(l=0;l<10;l++){
		if(x[l]>high && highest > x[l] && higher > x[l]){
		high=x[l];
		}
	}
	printf("%d\n%d\n%d\n",highest,higher,high);
	
return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int v[10];
    for (int i=0; i<10; ++i) {
        cin >> v[i];
    }
    sort(v, v + 10);
    cout << v[9] << endl << v[8] << endl << v[7] << endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a[10],k=0,tmp,i;
	for(i=0;i<10;i++)
		cin>>a[i];
	while(1){//無限ループ
		for(i=0;i<10;i++){
			if(a[i]<a[i+1]){//もし昇順でない場合
				tmp=a[i];//隣接しあう値を昇順に入れ替える
				a[i]=a[i+1];
				a[i+1]=tmp;
				k++;//カウント
			}
		}
		if(k==0) break;//入れ替える必要がなくなったら終了
		k=0;//カウントの初期化
	}
	for(i=0;i<10;i++)
		cout<<a[i]<<endl;
	return 0;
}

C++: # include "iostream"
using namespace std;

int main()
{
	int a[10];
	int i, j;

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

	for (i = 1; i < 10; i++)
		for (j = 0; j < 10 - i; j++)
			if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);

			cout << a[9] << endl << a[8] << endl << a[7] << endl;


	return 0;
}

C++: #include <iostream>
using nameplace std;
int main(){
   int h[10];
 for(int i=0;i<10;i++){
      cin>>h[i];
 }
 for(int i=0;i<10;i++){
  for(int j=0;j<10-i;j++){
        if(h[j]<h[j+1]){
          swap(h[j],h[j+1]);
         }
      }
}
cout<<h[0]<<endl;
cout<<h[1]<<endl;
cout<<h[2]<<endl;
return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;
int main() {
 int d;
 priority_queue<int> qu;
 for (int i=0;i<10;i++) { cin >> d; qu.push(d);}
 for (int i=0;i<3;i++) { cout << qu.top() << endl; qu.pop(); }
 return 0;
}

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
	int a=0;
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	for(int d=0;d<3;d++){
		for(int i=0;i<10;i++){
			if(vec[i]>a)a=vec[i];
		}
		std::cout<<a<<std::endl;
		for(int i=0;i<10;i++){
			if(vec[i]==a)vec[i]=0;
		}
		a=0;
	}
	return 0;
}

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

using namespace std;

int main() {
	vector<int> h(10);
	for (int i = 0; i < 10; ++i) cin >> h[i];

	sort( h.begin(), h.end(), greater<int>() );

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

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define EXIST2(s,e) (find(ALL(s),(e))!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define EACH(t,i,c) for(t::iterator i=(c).begin(); i!=(c).end(); ++i)
const double EPS = 1e-10;
const double PI  = acos(-1.0);


int main(){
	vi a;
	REP(i,10){
		cin>>a[i];
	}
	sort(RALL(a));
	cout<<a[0]<<endl;
	cout<<a[1]<<endl;
	cout<<a[2]<<endl;
}

C++: #include <iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;

int main()
{
    int  i=0,j=0;
    int a[10]={};


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


    //cout << endl;

return 0;

}

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

int main()
{
	int mountain[10] = { 0 };
	int i, j, max, tmp;
	for(i = 0; i < 10; i++)
		cin >> mountain[i];
	for(i = 0; i < 10; i++)
	{
		max = i;
		for(j = i; j < 10; j++)
		{
			if(mountain[j] > mountain[max])
				max = j;
		}
		tmp = mountain[i];
		mountain[i] = mountain[max];
		mountain[max] = tmp;
	}
	for(i = 0; i < 3; i++)
	{
		cout << mountain[i] << endl;
	}
}

C++: #include<iostream>

using namespace std;
 
int main(){
  int x[10],tmp,i,j;

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

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

  /*
  for(i=0; i<10; ++i){
    for(j=i+1; j<10; ++j){
      if(x[i] < x[j]){
	tmp = x[i];
	x[i] = x[j];
	x[j] = tmp;
      }
    }
  */
  }

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

    return 0;
}

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

C++: #include<stdio.h>

int main(void){

	int h[10];
	
	int i,j,t;
	for(i=0;i<10;i++){
		printf("%d",i+1);
		scanf("%d",&h[i]);
	}
	for(i=0;i<9;i++)
	{
		for(j=i;j<10;j++)
		{
			if(h[i]<h[j])
			{
			   t=h[i];
			   h[i]=h[j];
			   h[j]=t;
			}
		}
	}
	for(i=0;i<3;i++)
	{
		printf("%d\n",h[i]);
	}


	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int x, buf, i, j;
  int top[3];
  for(i = 0; i < 3; i++)
    top[i] = 0;

  for(i = 0; i < 10; i++){
    cin >> x;
    if(x > top[2]){
      top[2] = x;
      j = 2;
      while(j > 0){
        if(top[j-1] <top[j]){
          top[j-1] = buf;
          top[j-1] = top[j];
          top[j] = buf;
          j--;
        }else{
          break;
        }
      }
    }
  }

  for(i = 0; i<3; i++)
    cout << top[i] << '\n';

  return 0;
}