Go: package main

import (
	"fmt"
	"sort"
)

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

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

	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))

	for i := 0; i < 3; i++ {
		fmt.Println(mountains[i])
	}
}

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

int main(){
	int nya[9];
	int hoge;
	for (int j=0;j<10;j++) {
		cin >> nya[j];
	}
	for (int i=0;i<20;i++){
		for (int k=0;k<10;k++){
		if (nya[k] > nya[k-1]) {
			hoge = nya[k-1];
			nya[k-1] = nya[k];
			nya[k] = hoge;
		}
		}
	}
	cout << nya[0] << endl << nya[1] << endl << nya[2] << endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <climits>
#include <string>
#include <vector>
#include <cmath>

using namespace std;

#define str to_string
#define rep(i, n) for (int i=0; i<int(n); i++)
#define all(c) (c).begin(), (c).end()

int table[10];

int main() {
  rep(i, 10) cin >> table[i];
  sort(table, table+10);
  rep(i, 3) cout << table[9-i] << "\n";
  return 0;
}

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

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

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

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  vector<int> h(10);
  REP(i, 10) cin >> h[i];
  sort(ALL(h));
  REP(i, 3) cout << h[9 - i] << endl;
  return 0;
}

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

C++: #include <stdio.h>
#include <stdlib.h>

int compare(const void * a, const void * b)
{
  return (*(int*)b - *(int*)a);
}

int main()
{
  int al[10];
  int i;
  for (i = 0; i < 10; i++) {
    int temp;
    scanf("%d", &temp);
    al[i] = temp;
  }
  qsort(al,10,sizeof(int),compare);
  for (i = 0; i < 3; i++) {
    printf("%d\n", al[i]);
  }

  return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
	long int a[10];

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

	sort(a, a+10);

	for(int i=9; i>=0; i--)
		cout<<a[i]<<endl;
	return 0;
}

C++: #include<iostream> 
using namespace std;
void bubblesort(int A[]){
	for(int i=0;i<10;i++){
		for(int j=10-1;j>i;j--){
			if(A[j]>A[j-1]){
			int t=	A[j-1];
			A[j-1]=A[j];
			A[j]=t;
			}
		}
	}	
}
int main(){
	int A[10];
	for(int i=0;i<10;i++){
		cin>>A[i];
	}
	for(int i=0;i<3;i++)
	{
		bubblesort(A);
		if(i>0)cout<<endl;
		cout<<A[i];
	 } 
    return  0;
}

C++: #include<iostream>

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

	for(i=0;i<10;i++){
		std::cin >> a[i];
		}

	for(i=0;i<9;i++){
		for(j=i+1;j<10;j++){
			if(a[i]<a[j]){
				n = a[i];
				a[i] = a[j];
				a[j] = n;
				}
			}
		}
	for(i=0;i<3;i++){
		std::cout << a[i] << std::endl;;
		}
	
	return 0;
}

C++: #include<stdlib.h>
#include<stdio.h>

int compare(const void* s,const void *t ){
  return (*((int*)t) - *((int*)s));
}

int main(){
  int height[10];
  int i=0;
  while(~scanf("%d",&height[i++]));
  qsort(height, 10, sizeof(height[0]), compare );
  for( i = 0; i < 3 ; i++ )
    printf("%d\n",height[i]);
  return 0;
}

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

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

void swap(int *a, int *b) 
{
    int tmp;
    tmp = *a;
    *a = *b;
    *b = tmp;
}

int main(){

	int a[11],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 = a[1];

	for (int i=2; i<11; i++){
		if (max1 < a[i]){
			swap(max1,a[i]);
		}
	}
	max2 = a[2];

	for (int i=3; i<11; i++){
		if (max2 < a[i]){
			swap(max2,a[i]);
		}
	}
	max3 = a[3];

	for (int i=4; i<11; i++){
		if (max3 < a[i]){
			swap(max3,a[i]);
		}
	}


		cout << max1 << endl;
		cout << max2 << endl;
		cout << max3 << endl;
		

return 0;
	}

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

int main() {
	int first, second, third, input[10];
	first=0;
	second=0;
	third=0;
	cin >> input[0]
	cin >> input[1]
	cin >> input[2]
	cin >> input[3]
	cin >> input[4]
	cin >> input[5]
	cin >> input[6]
	cin >> input[7]
	cin >> input[8]
	cin >> input[9]
	int i;
	for(i=0;i<=10;i++){
		if(input[i] > third){
			if(input[i] > second){
				if(input[i] > first){
					first=input[i];
				}else{
					second=input[i];
				}
			}else{
				third=input[i];
			}
		}
	}
	cout << first << endl;
	cout << second << endl;
	cout << third << endl;
	return 0;
}

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

using namespace std;

int compare(const void *a, const void *b)
{
    return *(int*)a - *(int*)b;
}

int main(){
    int arr[10];

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

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


    return 0;
}

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

using namespace std;

int main(){
	int a[10] = {0};
	for(int i = 0; i < 10; i++){
		cin >> a[i];
	}
	sort(a, a + 10);
	for(int i = 0; i < 3; i++){
		cout << a[i] << endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <stddef.h>
#include <ctype.h>
#include <float.h>
#include <limits.h>

const double  pi = 2 * acos (0.0);

int main()

{
    int a[10000],i,j,k,l,hand=0,temp=0,sum=0;

    for(i=0;i<10;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<10;i++)
    {
        if(a[i]>hand)
        {
            hand = a[i];
        }
    }
    printf("%d\n",hand);

    for(i=0;i<10;i++)
    {
        if(a[i]>temp)
        {
            if(a[i]==hand)
            {
                continue;
            }
            else
            {
                temp = a[i];
            }
        }
    }
    printf("%d\n",temp);

    for(i=0;i<10;i++)
    {
        if(a[i]>sum)
        {
            if(a[i]==hand || a[i]==temp)
            {
                continue;
            }
            else
            {
                sum = a[i];
            }
        }
    }
    printf("%d\n",sum);
}

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

int main() {
    int input[10];
    for(int i=0; i<10; ++i) {
        cin >> input[i];
    }
    sort(begin(input), end(input));
    cout << input[9] << "\n" << input[8] << "\n" << input[7] << endl;
}

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

int main() {
	
	typedef std::multiset<int> MySet;
	MySet heightSet;
	
	for(int i = 0; i < 10; ++i)
	{
		int val;
		cin >> val;
		heightSet.insert(val);
	}
	
	MySet::reverse_iterator rit = heightSet.rbegin();
	for(int i = 0; i < 3; ++i)
	{
		cout << *rit << endl;
		++rit;
	}
	
	return 0;
}