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<stdio.h>
#include<ctype.h>
#include<stdlib.h>
#include<string.h>
#include<time.h>
#include<math.h>
#include<algorithm>
using namespace std;  
int main()
{
	int ar[10],i;
	for(i = 0 ; i < 10  ; i++) scanf("%d",&ar[i]);
	sort(ar,ar + 10);
	printf("%d %d %d\n",ar[9],ar[8],ar[7]);
	
	return 0;
}

C++: 
class Main
{
	public static void main(String[] av)
	{
		java.util.Scanner sc = new java.util.Scanner(System.in);
		java.util.ArrayList<Integer> vec = new java.util.ArrayList<Integer>();
		while( sc.hasNextInt() )
		{
			vec.add( sc.nextInt() );	
		}
		java.util.Collections.sort( vec );
		java.util.Collections.reverse( vec );
		for ( int i = 0; i < 3; ++i )
		{
			System.out.println( vec.get(i) );
		}
	}
}

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

void exc( int& a, int& b ) {
    int buf;
    buf = a;
    a = b;
    b = buf;
}

int main() {
    int ns[10];
    int fst, scd = 0, trd = 0;
    for( int i = 0; i < 10; ++i ) {
        cin >> ns[i];
        if( i == 0 ) {
            fst = ns[ i ];
            continue;
        }
        if( ns[ i ] >= trd ) {
            trd = ns[ i ];
            if( trd > scd ) {
                exc( trd, scd );
                if( scd > fst ) {
                    exc( scd, fst );
                }
            }
        }
    }
    cout << fst << endl
         << scd << endl
         << trd << endl;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int arr[9],i,j,temp;

    for (i=0;i<9;i++)
    {cin>>arr[i];}
    for (i=0;i<9;i++)
    {
        for (j=0;j<9;j++)
        if (arr[j]>arr[j+1])
        {
            temp=arr[j];
            arr[j]=arr[j+1];
            arr[j+1]=temp;
        }
    }
    for (i=9;i>=0;i--)
    {
        cout<<arr[i];
        cout<<" ";
    }
    return 0;
}

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

int m[10];

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

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

int first = 0, second = 0, third = 0;

//???????????¨
void sort(){
	int buf = third;
	if(third > first){
	//3rd > 1st??????,1->2 2->3 3->1?????????
		third = second;
		second = first;
		first = buf;
	}else if(third > second){
	//3rd > 2nd??????,2->3 3->2?????????
		third = second;
		second = buf;
	}
}

int main(){
int buf;

for(int i = 0; i < 10; i++){
	cin >> buf;
	//3rd????????§?????????????????????
	if(buf > third){
		third = buf;
		sort();
	}
}

//??¨???
cout << first << "\n";
cout << second << "\n";
cout << third << "\n";

return 0;
}

C++:  #include<iostream>
 #include<fstream>

 using namespace std;

 int main(){

     ifstream ifs("in1.txt");

     int i;
     int height[3]={};
     int tmp, tmp2;
     string str;

     while(getline(ifs,str)){
         sscanf(str.c_str(),"%d",&tmp);
         if(0<=tmp && tmp <=10000){
             for(i=0;i<3;i++){
                 if(height[i] < tmp){
                     tmp2 = height[i];
                     height[i] = tmp;
                     tmp = tmp2;
                 }
             }
         }
     }

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

     return 0;
 }

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

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<long int>V;
long int h;
for(int i=0;i<10;i++){
    scanf("%ld",&h);
    V.push_back(h);
}
sort(V.begin(),V.end());
for(int i=9;i>6;i--){
    printf("%ld\n",V[i]);
}

return 0;
}

C++: #include <cstdio>
int main(){
    int input;
    int i;
    //scanf("%d",&input);
    int first=0,second=0,third=0;
    for(i=0;i<10;++i){
        scanf("%d",&input);
        if(input>first){
            third=second;
            second=first;
            first=input;
        }
        else if(input>second){
            third=second;
            second=input;
        }
        else if(input>third){
            third=input;
        }
    }
    printf("%d\n%d\n%d\n",first,second,third);
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int a[10];
    for(int i = 0; i < 10; i++){
        cin >> a[i];
    }
    
    sort(a, a + 10,greater<int>());
    
    cout << a[0] << endl;
    cout << a[1] << endl;
    cout << a[2] << endl;

}

C++: #include<stdio.h>
int main(void) {
	int i, mountain[10],x,y;
	int n = 0;
	int l = 0;
	int m = 0;
	for (i = 0;i < 10;i++) {
		scanf("%d", &mountain[i]);
	}
	for (i = 0;i < 10;i++) {
		if (mountain[i] > m) m = mountain[i];
		x = i;
	}
	printf("%d\n", m);
	for (i = 0;i < 10;i++) {
		if (i == x) {}
			else {if (mountain[i] > n) n = mountain[i];
			y = i;
		}
	}
	printf("%d\n", n);
	for (i = 0;i < 10; i++) {
		if (i == y || i == x) {}
		else	if (mountain[i] > l) l = mountain[i];
		
	}
	printf("%d\n", l);

	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+10);
	for(int i=9;i>6;i--){
		cout<<a[i]<<endl;
	}
	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
long long int nums[10];
void input()
{
	int i;
	for (i = 0; i < 10; i++)
		scanf("%lld", &nums[i]);
	sort(nums,nums+10);
	printf("%lld\n%lld\n%lld\n", nums[9], nums[8], nums[7]);
}
int main()
{
	input();
	return 0;
}

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

int main(){
  int num = 10;
  int height[num];

  for(int i=0; i<num; i++)
    cin >> height[i];

  int top3[3]={0,0,0};
  for(int i=0; i<num; i++) {
    for(int j=0; j<3; j++) {
      if(height[i] > top3[j]) {
        for(int k=2; k>j; k--)
          top3[k] = top3[k-1];
        top3[j] = height[i];
        break;
      }
    }
  }

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

  return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int high[10] = { };
	int first = 0, second = 0, third = 0;
	
	for(int i = 0; i < 10; i++){
		cin >> high[i];
		
		if(first <= high[i]){
			second = first;
			third = econd;
			first = high[i];
		}
		else if(second <= high[i]){
			third = second;
			second = high[i];
		}
		else if(third <= high[i])
			third = high[i];
	}
	
	cout << first << endl << second << endl << third << endl;
	
	
	return 0;
}

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

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


int main() {
	int a[10];
	
	for(int i = 0;i < 10;i++)
		cin >> a[i];
	
	qsort(a,10,sizeof(int),compare_int);
	
	for(int i = 0;i < 3;i++){
		cout << a[i];
		cout << "\n";
	}
	
	// your code goes here
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){

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

return 0;
}

C++: #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
// Whenever you start to believe  yourself, people also start to believe in you
using namespace std;
int cmpfunc (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}
int main()
{
    int n=10;
   int ara[n];
   int i,j,k;
   for(i=0;i<n;i++)
   {
       cin>>ara[i];
   }
   qsort(ara,n, sizeof(int), cmpfunc);
   cout<<ara[n-1]<<endl;
   cout<<ara[n-2]<<endl;
   cout<<ara[n-3]<<endl;
    return 0;
}