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>
#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;
    // set ???????´?????????\????????¨??????????????????????????????
    heightSet.insert(val);
  }

  // ??§??????????????¢???????????????????????? reverse_iterator ?????????
  MySet::reverse_iterator rit = heightSet.rbegin();
  for(int i = 0; i < 3; ++i)
  {
    cout << *rit << endl;
    ++rit;
  }
  return 0;
}

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

using namespace std;

int main(){

  vector<int> mountain;
  int height;

  for(int i=0; i<10; i++){
    cin >> height;
    mountain.push_back(height);
  }

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

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

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

int main(){
  vector<int> A(10);

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

  sort(A.begin(), A.end());

  cout << A[9] << endl;
  cout << A[8] << endl;
  cout << A[7] << endl;
}

C++: #include<stdio.h>
int main(void)
{
	int a, b, max, max2, max3;
	for (a = 1; a <= 10; a++) {
		scanf("%d",&b);
		if (b > max) {
			max = b;
		}
		else if (b > max2) {
			max2 = b;
		}
		else if (b > max3) {
			b = max3;
		}
		printf("%d\n %d\n %d\n ", max, max2, max3);
		return 0;
	}
}

C++: #include<stdio.h>
int main(void)
{
	int i,j,n,temp;
	int data[10];
	n = 1;
	for(i=0; i<10; i++){
		n++;
		scanf("%d",&data[i]);
	}

	for(i=0; i<9; i++){
		for(j=i+1; j<10; j++){
			if(data[i] > data[j]){
				temp=data[i];
				data[i]=data[j];
				data[j]=temp;
			}
		}

	}

		printf("%d\n",data[9]);
		printf("%d\n",data[8]);
		printf("%d\n",data[7]);
	return 0;
}

C++: #include<stdio.h>

int main(void){

    /* 宣言と初期化 */
    int hai[10];
    int i;
    int temp2nd;
    int temp3rd
    int tempmax;

for(i=0;i<10;i++)
{
printf("山の高さ　");
scanf("%d",hai[i]);
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0]

    /* 計算 */
    for(i=0;i<=10;i++){
        /* 最大値求める */
        if(hai[i]>tempmax)
        tempmax=hai[i];
    }

    for(i=0;i<=10;i++){
        /*2番目求める */
        if(hai[i]<tempmax&&hai[i]>temp2nd)
        temp2nd=hai[i];
    }

    for(i=0;i<=10;i++){
        /* 3番目求める */
        if(hai[i]>temp3rd&&hai[i]<temp2nd)
        temp3rd=hai[i];
    }

    /* 表示 */
    printf("最も高い山の高さ　%d\n",tempmax);
    printf("２番目に高い山の高さ　%d\n",temp2nd);
    printf("３番目に高い山の高さ　%d\n",temp3rd);

    return 0;
}

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

#define MAX 1000000
#define INF 200000000
#define MOD 1000000007

typedef long long ll;
typedef unsigned long long llu;

using namespace std;

int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};

void IO()
{
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
}

int arr[15];

bool cmp(int a, int b)
{
    return a>b;
}

int main()
{
    //IO();
    for(int i=0;i<10;i++)scanf("%d",&arr[i]);
    sort(arr,arr+10,cmp);
    for(int i=0;i<3;i++)printf("%d\n",arr[i]);
    return 0;
}

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

using namespace std;

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

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

int i,j,a[12];

int comp(const void *p,const void *q){
	return *(int *)q-*(int *)p;
}

int main(){
	//scanf("%d",&a[0]);
	for(i=0;i<10;i++)scanf("%d\n",&a[i]);
	
	qsort(a,10,sizeof(int),comp);
	
	printf("%d\n",a[0]);
	printf("%d\n",a[1]);
	printf("%d",a[2]);
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    vector<int> A(10);
    for(int i = 0; 10 > i; i++){
        cin>>A[i];
    }
    sort(A.begin(),A.end(),greater<int>());
    for(int i = 0; 3 > i; i++){
        cout << A[i] << endl;
    }
}

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

#define REP( i, n )	for( int (i) = 0; (i) < (n); (i)++ )
#define ALL( x )	(x).begin(), (x).end()

int main() {
	vector<int> m(10);
	REP( i, 10 ) cin >> m[i];

	sort( ALL(m), greater<int>() );
	cout << m[0] << endl << m[1] << endl << m[2] << endl;
	
}

C++: #include<iostream>
#include<vector>
int main(){
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	while(1){
		int a,b=0;
		for(int j=0;j<10;j++){
			if(vec[j]>vec[j+1]&&j+1<10){
				a=0;
				a=vec[j];
				vec[j]=vec[j+1];
				vec[j+1]=a;
				b++;
			}
		}
		if(b==0)break;
	}
	for(int i=9;i>=7;i++){
		std::cout<<vec[i]<<std::endl;
	}
	return 0;
}

C++: Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.

C++: #include<stdio.h>
int main()
{
    int ara[12],i,j,t,n=10;
    for(i=0;i<n;i++)
    {
        scanf("%d", &ara[i]);
    }
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(ara[j]>ara[j+1])
            {
                t=ara[j];
                ara[j]=ara[j+1];
                ara[j+1]=t;
            }
        }
    }
    for(i=9;i>6;i--)
        printf("%d\n", ara[i]);
    return 0;
}