Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
	"strings"
)

var maxint = 10000
var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	scanner.Scan()
	return strconv.Atoi(scanner.Text())
}

func main() {
	scanner.Split(bufio.ScanWords)
	arr := make([]int, 10)
	for i := range arr {
		n, _ := nextInt()
		arr[i] = n
	}

	sort.Slice(arr, func(i, j int) bool {
		return arr[i] >= arr[j]
	})

	arrStr := fmt.Sprintf("%+v", arr[0:3])
	arrStr = arrStr[1:(len(arrStr) - 1)]
	arrStr = strings.Replace(arrStr, " ", "\n", -1)
	fmt.Println(arrStr)
}

C++: #include <bits/stdc++.h>
using namespace std;
int main()
{
    vector<int>vec;
    for(int i = 0;i < 10;++i)
    {
        int v; cin >> v;
        vec.push_back(v);
    }
    sort(vec.begin(),vec.end());
    cout << vec[9] <<endl<< vec[8] <<endl << vec[7] <<endl;
    return 0;
}

C++: /*
List of Top 3 Hills
?±±???????????????????????????????????´??°??§??¨?????? 10 ?????????????????????????????????
?????? 10 ?????????????????????????????????
???????????§????????????????????????????????????????????°?????????????????????????????????
*/

#include <iostream>
#include <array>

using namespace std;

int main()
{
	// ?????°??£?¨?
	array< int, 10 > array1;

	// ??\?????????
	for ( int i = 0; i < 10; i++ ) {
		cin >> array1[ i ];
	}

	// ???????????????
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 0; j < i; j++ ) {
			if ( array1[ j ] > array1[ i ] ) {
				int tmp = array1[ i ];
				array1[ i ] = array1[ j ];
				array1[ j ] = tmp;
			}
		}
	}

	// ????????????
	cout << array1[ 9 ] << endl << array1[ 8 ] << endl << array1[ 7 ] << endl;

	return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;

for(int i,i<10,i++){
cin>>input[i];
if(first<input){
 first = input[i];
}else if(second<input){
 second = input[i];
}else if(third<input){
 third = input[i];
}


}
cout<<first<<endl<<second<<endl<<third<<endl;
return 0;

}

C++: //include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
 
//using namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
 
//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
 
//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
 
//const------------------------------------------------------------------------------------------------------------------------
const double EPS = 1e-10;
const double PI = acos( -1.0 );
 
//global-----------------------------------------------------------------------------------------------------------------------
vector<int> a(10);
 
//function---------------------------------------------------------------------------------------------------------------------
int main() {
    rep( i, 10 ) {
        scanf( "%d", &a[ i ] );
    }
    sort( a.begin(), a.end() );
    ROF( i, 9, 7 ) {
        printf( "%d\n", a[ i - 1 ] );
    }
    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 t=0; t<9; t++){

	 	for(int s=t+1; s<10; s++ ){

	 		if(a[s]>a[t]){

	 			int num=a[s];

	 			a[s]=a[t];

	 			a[t] = num;
	 		}
	 	}
	 }

	 for (int j=0; j<3; j++){

	 	cout << a[j] << endl;
	 }
}

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

C++: #include <stdio.h>

int main(){
  int a[10], max, maxidx;
  for(int i=0; i<=9; i++){
    scanf("%d", &a[i]);
  }
  for(int j=0; j<3; j++){
    max = -1;
    for(int i=0; i<=9; i++){
      if(a[i] > max){
	max = a[i];
	maxidx = i;
      }
    }
    printf("%d", max);
    a[maxidx] = -1;
  }
}

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

using namespace std;

int main()
{
	vector<int> mountains;

	for (int i = 0; i < 10; i++){
		int mountain;
		scanf("%d", &mountain);
		mountains.push_back(mountain);
	}
	sort(mountains.begin(), mountains.end());
	for (int i = 0; i < 3; i++)
		printf("%d\n", mountains[9 - i]);

	return (0);
}

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

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

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

  sort(a,a+10);

  for(i=9;i>=7;i--){
    cout << a[i] << endl;
  }
}

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

int main_test()
{
	string str;
	cout << "あなたの名前を入力してください" << endl;
	cin >> str;
	cout << str <<"さんよろ"<<endl;

	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	const int len = 10;
	int arr[len];

	for (int i = 0; i < len; i++)
		cin >> arr[i];

	for (int i = 0; i < len; i++)
		for (int j = 0; j < len; j++)
			if (arr[i] < arr[j])
				swap(arr[i], arr[j]);

	cout << endl;

	for (int i = len - 1; len - 4 < i; i--)
		cout << arr[i] << endl;

	return 0;
}

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 <string>

using namespace std;

main(){
	int i, j;
	int data[10] = {0};
	int buf;

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

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

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

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);
}

for (int i = 0; i < 100000; i++){
	for (int j = 0; j < 10000; j++){
		b = 0;
	}
}

sort(a.begin(), a.end());
cout << a[9] << endl << a[8] << endl << a[7] << endl;

return 0;
}