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++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(void)
{
    vector <int> a;
    int b;

    for (int i = 0; i < 10; i++){
    cin>>b;
a.push_back(b);
}
sort(a.begin(), a.end());
cout << a[9] << endl << a[8] << endl << a[7] << endl;

return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
 
int main(){
     int a[10],i,judge;
     for(i=0;i<10;i++) cin >> a[i];
     judge = 0;
     do{
       judge = 1;
       for(i=0;i<9;i++){
         if(a[i]<a[i+1]){
           swap(a[i],a[i+1]);
           judge = 0;
         }
       }
     }while(!judge);
 
     for(i=0;i<3;i++)
       cout << a[i] << endl;
 
   return 0;
}

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

int main(void)
{
  vector<int> v(10);

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

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

  for (int i = 0; i < 3; i++) cout << v[i] << endl;

  return 0;
}

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

int main()
{
	int h[10];
	for (int i = 0; i < 10; ++i) cin >> h[i];
	sort(h, h+10, greater<int>());
	
	cout << h[0] << endl << h[1] << endl << h[2] << endl;
	
	return 0;
	
}

C++: # -*- config: utf-8 -*-
if __name__ == '__main__':
	hills = []
	for i in range(10):
		tmp = raw_input()
		hills.append(int(tmp))
	hills.sort(reverse=True)

	for i in range(3):
		print hills[i]

C++: #include <iostream>
#include <stdio.h>
using namespace std;
int main(){
    int fst = 0;
    int snd = 0;
    int thd = 0;
    int tmp=0;
    std::cin >> fst;
    for(int i=0;i<9;i++) {
        tmp = 0;
        std::cin >> tmp;
        if(fst < tmp) {
            thd = snd;
            snd = fst;
            fst = tmp;
        }else if(tmp > snd){
            thd = snd;
            snd = tmp;
        }else if(tmp > thd){
            thd = tmp;
        }else{}
    }
    printf("%d\n%d\n%d\n",fst,snd,thd);
}

C++: 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 <algorithm>

using namespace std;
int main(){
  int list[10];
  for(int i=0;i<10;i++){
    cin >> list[i];
  } 
  reverse(list,list+10);
  
  for(int j=0;j<3;j++){
    cout<< list[j] << endl;
  }
  return 0;
}

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

C++: #include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
   
using namespace std;

int main()
{
    vector<int> mountain;
    for(int i = 0; i < 10; i++){
        int tmp;
        cin >> tmp;
        mountain.push_back(tmp);
    }
    sort(mountain.begin(), mountain.end());
    reverse(mountain.begin(), mountain.end());
    for(int i = 0; i < 3; i++){
        cout << mountain[i] << endl;
    }
    return 0;
}

C++: #include <iostream>

int main(){
    int a[10];
    for(int i = 0; i < 10; i++){
        std::cin >> a[i];
    }
    
    for(int k = 0; k < 3; k++){
        int idx = 0;
        for(int i = 0; i < 10; i++){
            if(a[idx] < a[i]){
                idx = i;
            }
        }
        std::cout << a[idx] << std::endl;
        a[idx] = 0;
    }
    return 0;
}

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

C++: #include <stdio.h>

int main(){
	int i,j;
	int h1=0,h2=0,h3=0;
	
	for(i=1;i<10;i++){
		scanf("%d\n",&j);
		if(j>=h1){
			h3=h2;
			h2=h1;
			h1=j;
		}
		else if(j>=h2){
			h3=h2;
			h2=j;
		}
		else if(j>=h3){
			h3=j;
		}
	}
	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	long long a[100];
	long long max, bat,temp, temp1;
	bat = 10;
	for (int i = 1; i <= 10; i++)
		cin >> a[i];
	
	for (int i = 1; i <= 11; i++)
	{
		max = 0;
		for (int j = 1; j <= bat; j++)
			if(a[j] > max)
			{
				max = a[j];
				temp1 = j;
			}
		
		temp = a[bat];
		a[bat] = a[temp1];
		a[temp1] = temp;
		bat--;
		
	}
	for (int i = 10; i > 7; i--)
		cout << a[i] << endl;
	
}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>

using namespace std;

//conversion
//------------------------------------------
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
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TII;
typedef long long LL;
typedef vector<LL> VLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define MT(a,b,c) MP(a, MP(b, c))

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

int main(void){
	VI v(10);
	REP(i,10)cin>>v[i];
	SORT(v);
	REP(i,3)cout << v[9-i] << endl;
	return 0;
}

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

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

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

int main()
{
	std::array<int, 10> high;
	for (int i = 0; i < 10; ++i)
		std::cin >> high[i];

	std::sort(high.begin(), high.end());

	std::cout << high[9] << " " << high[8] << " " << high[7] << std::endl;
}

C++: int main()
{
	int i,j;
	int rank1 = 0;
	int mountain[10] = {0};
	for (i = 0; i < 10; i++) {
		scanf_s("%d", &mountain[i]);
	}



	for (i = 0; i < 10; i++) {
		for (j = i + 1; j < 10; j++) {

			if (mountain[j] > mountain[i])
			{
				rank1 = mountain[i];
				mountain[i] = mountain[j];
				mountain[j] = rank1;
			}
		}
	}

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

		}
	
	


    return 0;
}