Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

C++: #include<stdio.h>

int main(){
int i,j,yama[10],temp;
for(i=0;i<10;i++){
scanf("%d",&yama[i]);
}
for(i=0;i<10;i++){
for(j=0;j<10;j++){
if(yama[i]>yama[j])
temp=yama[i];
yama[i]=yama[j];
yama[j]=temp;
}
}
for(i=0;i<3;i++){
printf("%d\n",yama[i]);
}
return 0;
}

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

int main()
{
	int max = 0;
	int max2 = 0;
	int max3= 0;
	int a[10];

	for (int i = 0; i < 10; i++) {
		scanf("%d", &a[i]);
		if (max < a[i]) max = a[i];
	}
	
	for (int i = 0; i < 10; i++) {
		if (max2 < a[i] && a[i] < max) max2 = a[i];
	}

	for (int i = 0; i < 10; i++) {
		if (max3 < a[i] && a[i] < max2) max3 = a[i];
	}


		printf("%d\n", max);
		printf("%d\n", max2);
		printf("%d\n", max3);

		return (0);
	
}

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

using namespace std;

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

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

C++: #include <iostream>
using namespace std;
int main()
{
	int arr[10];
	int max1 , max2 , max3;
	int i;
	for ( i = 0 ; i < 10 ; i++)
		cin >> arr[i];
	max1 = arr[0];
	for ( i = 0 ; i < 10 ; i++)
	{
		if ( max1 < arr[i])
		{
			max3 = max2;
			max2 = max1;
			max1 = arr[i];
		}
		else if ( max2 < arr[i])
		{
			max3 = max2 ;
			max2 = arr[i];
		}
		else if ( max3 < arr[i])
		{
			max3 = arr[i];
		}
	}
	cout << max1 << endl << max2 << endl << max3 << endl ;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
    int a=-1,b=-1,c=-1,moun;
    for(int i=0;i<10;i++){
        cin>>moun;
        if(moun>a){
            c=b;
            b=a;
            a=moun;
        }else if(moun>b){
            c=b;
            b=moun;
        }else if(moun>c)
            c=moun;
    }
    cout<<a<<endl<<b<<endl<<c<<endl;
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	
	
		int a[10],i;
		for(i=0;i<10;i++){
			scanf("%d",&a[i]);
		}
		sort(a,a+10);
		for(i=9;i>6;i--){
			printf("%d\n",a[i]);
		}
		return 0;
}

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

int main() {
	// your code goes here
	int data[10],ansdata[3];
	for (int j = 0;j<3;j++) {
		ansdata[j] = 0;
	}
	for (int i=0;i<=9;i++) {
		cin >> data[i];
		if (i==0) {
			ansdata[0] = data[i];
		}
		if (i>0) {
			if (data[i] > ansdata[2]) {
				if (data[i] > ansdata[1]) {
					ansdata [2] = ansdata [1];
					if (data[i] > ansdata[0]) {
						ansdata [1] = ansdata [0];
						ansdata [0] = data [i];	
					}
					else {
						ansdata[1] = data[i];
					}
					
				}
				else {
					ansdata[2] = data[i];
				}
			}

		}
	}
	cout << ansdata[0] << endl << ansdata[1] << endl << ansdata [2] ;
	return 0;
}

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

int main()
{
	int x[10];
	for (int i = 0; i < 10; i++)
	{
		cin >> x[i];
	}
	sort(begin(x),end(x));

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

	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int i, j, max;
	int v[10];
	for (i = 0; i < 10; i++) {
		cin >> v[i];
	}
	for (i = 0; i < 3; i++) {
		max = v[i];
		for (j = i; j < 10; j++) {
			if (max < v[j]) {
				max = v[j];
				v[j] = v[i];
				v[i] = max;
			}
		}

	}

	cout << v[0] <<"\n";
	cout << v[1] << "\n";
	cout << v[2] << "\n";
}

C++: #include <cstdio>
int main(){
 int top3[3];
 int i,tmp;
 for(i=0;i<10;i++){
  scanf("%d",&data);
  if (top3[2]>data) {} 
  else {
   top3[2]=data;
   if (top3[1]>data) {} 
   else {
    top3[2]=top3[1];
    if (top3[0]>data) top3[1]=data;
    else {
     top3[1]=top3[0];
     top3[0]=data;
    };
   };
  };
 };
 for(i=0;i<3;i++)
    printf("%d\n",top[i]);
};

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

int main()
{
    int x[10];
    cout << sizeof(x) << endl;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        cin >> x[i];
    int first = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > first)
            first = x[i];
    int second = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > second && first > x[i])
            second = x[i];
    int third = 0;
    for (unsigned int i = 0; i < sizeof(x) / sizeof(int); i++)
        if (x[i] > third && second > x[i])
            third = x[i];
    cout << first << endl;
    cout << second << endl;
    cout << third << endl;
}

C++: #include <iostream>
#include <cstdlib>
#include <ctime>
#include <algorithm>

#define BOGO 10

using namespace std;

int main()
{
	int arr[BOGO];
	bool found;
	int j;
	srand(static_cast<unsigned int>(time(NULL)));
	
	for(int i = 0; i < BOGO; i++){
		cin >> arr[i];
	}
	
	for(;;){
		
		/**
		for(int j = 0; j < BOGO; j++){
			cout << arr[j] << flush;
		}
		cout << endl;
		/**/
		
		found = true;
		for(j = 0; j < BOGO-1; j++){
			if(arr[j] > arr[j+1]){
				found = false;
				break;
			}
		}
		
		if(found){
			break;
		}
		random_shuffle(arr, arr+BOGO);
	}
	cout << arr[9] << "\n" << arr[8] << "\n" << arr[7] << endl;
}

C++: 
#include<stdio.h>

int main()
{
	int high[10] = {1819,2003,876,2876,1723,1673,3776,2848,1592,922};
	int cases;
	
	for(int i=0;i<10;i++)
	{
		for(int j=i;j<10;j++)
		{
			if(high[i] > high[j])
			{
				cases = high[i];
				high[i] = high[j];
				high[j] = cases;
			}
		}
	}
	
	printf("%d",high[0]);
	printf("%d",high[1]);
	printf("%d",high[2]);
	
	return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int a=0,b=0,c=0,t=0,n=10;
    while(n--)
    {
              cin>>t;
              if(t>c)
              {
                     if(t>b)
                     {
                            if(t>a)
                            {
                                   c=b;
                                   b=a;
                                   a=t;
                                   
                            }
                            else
                            {
                                c=b;
                                b=t;
                                }
                     }
				  else
				 {
					 c=t;
				  }
			  }
      }
              cout<<a<<endl<<b<<endl<<c<<endl;              
			  cin>>n;
   return 0;
    }

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

int main(){

	int i;
	int height[10];

	for (i = 0; i < 10; i++){
		do{
			cin >> height[i];
		} while (height[i] < 0 || height[i] > 10000);
	}

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

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

	return 0;
}