Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	counter := 0
	var mountain []int
	for scanner.Scan() {
		i, err := strconv.Atoi(scanner.Text())
		if err != nil {
			break
		}
		mountain = append(mountain, i)
		counter++
		if counter == 10 {
			break
		}

	}
	sort.Ints(mountain)
	fmt.Println(mountain[9])
	fmt.Println(mountain[8])
	fmt.Println(mountain[7])
}

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

int main() {
    vector<int> mountain;
    for(int i = 0; i < 10; i++){
      cin >> mountain.at(i);
    }
    sort(mountain.begin(), mountain.end());
    reverse(mountain.begin(), mountain.endl());

    for (int i = 0; i < 3; i++) {
        cout << mountain.at(i) << endl;
    }
}

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

int main()

{
    int i,j,n,temp;
    int a[10];
    n=10;

    for(i=0;i<n;i++){
        scanf("%d",&a);
    }

    for(i=0;i<10;i++){
        for(j=i+1;j<10;j++){

               if(a[i] < a[j]) {
                temp=a[i];
                a[i]=a[j];
                temp=a[j];
               }

        }
    }

    for(i=0;i<3;i++){
        printf("%d\n",a[i]);
    }

return 0;
}

C++: #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cstring>
#include <climits>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
 
int MOD = 1000000007;

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

C++: #include<stdio.h>
??
void swap(int *x,int *y){
????????????????int temp;
??
????????????????temp=*x;
????????????????*x=*y;
????????????????*y=temp;
??
}
??
int main(void){
????????????????int i,j,k;
????????????????int height[10];
??
????????????????i=0;
??
????????????????while(scanf("%d",&height[i])==1){
????????????????????????????????i++;
????????????????????????????????if(i==10) break;
????????????????}
??
??
????????????????for(j=0;j<10;j++){
????????????????????????????????if(height[j]<0 || height[j]>10000){
????????????????????????????????????????????????height[j]=0;
????????????????????????????????}
????????????????}
??
??
??
????????????????for(i=0;i<10;i++){
????????????????????????????????for(j=0;j<10;j++){
????????????????????????????????????????????????if(height[i]<height[j]){
????????????????????????????????????????????????swap(&height[i],&height[j]);
????????????????????????????????????????????????}
????????????????????????????????}
????????????????}???????????? /*sort*/
??
????????????????printf("\n");
??
????????????????k=9;
??
??
????????????????while(1){
????????????????????????????????printf("%d\n",height[k]);
????????????????????????????????k--;
????????????????????????????????if(k==6) break;
????????????????}
??
??
??
??
????????????????return 0;
}

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

void swap(int& a, int& b) {
	int x = a;
	a = b;
	b = x;
}

int main(){
	int first = 0;
	int second = 0;
	int third = 0;

	for(int i = 0; i < 10; ++i) {
		int x;
		cin >> x;
		if(third <= x)		third = x;
		if(second <= third)	swap(second, third);
		if(first <= second)	swap(first, second);
	}
	printf("%d\n%d\n%d\n", first, second, third);

	return 0;
}

C++: #include<iostream>
#include<vector>
std::vector<int> qsort(std::vector<int> xs);

int main(){
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	qsort(vec);
	std::cout<<vec[9]<<vec[8]<<vec[7]<<std::endl;
	return 0;
}

std::vector<int> qsort(std::vector<int> xs){
	if(xs.empty()){
		return xs;
	}else{
		int x=xs[0];
		std::vector<int> left;
		std::vector<int> right;
		for(int i=1;i<xs.size();i++){
			if(xs[i]>x){
				left.push_back(xs[i]);
			}
			if(xs[i]<=x){
				right.push_back(xs[i]);
			}
		}
		left=qsort(left);
		right=qsort(right);
		left.push_back(x);
		left.insert(left.end(),right.begin(),right.end());
		return left;
	}
}

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

C++: #include<iostream>
#include<algorithm>
int main() {
	int n[10];
	for (int i = 0; i < 10; i++) {
		int y;
		std::cin >> y;
		n[i] = y;
	}
	std::sort(n, n + 10);
	for (int i = 1; i < 4; i++) {
		std::cout << n[10 - i] << std::endl;
	}
}

C++: #include <stdio.h>
 
int
main(void)
{
    char line[80];
    int h[3] = { 0 };
    int m;
 
 	for (int i = 0 ; i < 10; i++) {
	    if (gets(line)) {
	        if (sscanf(line, "%d", &m) == 1) {
				if (m >= h[0]) {
					if (m > h[0]) {
						h[2] = h[1];
						h[1] = h[0];
						h[0] = m;
					}
				} else if (m >= h[1]) {
					if (m > h[1]) {
						h[2] = h[1];
						h[1] = m;
					}
					h[1] = m;
				} else if (m >= h[2]) {
					h[2] = m;
				}
			}
	    }
 	}
 	
 	for (int i = 0 ; i < 3; i++) {
 		printf("%d\n", h[i]);
 	}
 	
    return 0;
}

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

using namespace std;

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

	return 0;
}

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

void swap(int &x, int &y) {
	int a;
	a = x;
	x = y;
	y = a;
}

int main() {
	int a[10],max,mid,min;
	for (int i=0; i<10; i++) {
		cin >> a[i];
	}
	max = a[0];
	mid = a[1];
	min = a[2];
	if (mid > max) {
		swap(max, mid);
	}
	if (mid < min) {
		swap(mid, min);
	}
	for (int j=3; j<10; j++) {
		if (a[j] > max) {
			min = mid;
			mid = max;
			max = a[j];
		}else if (a[j] > mid) {
			min = mid;
			mid = a[j];
		}else if (a[j] > min) {
			min = a[j];
		}
	}
	cout << max << endl << mid << endl << min << endl;
}

C++: #include<iostream>
#include<algorithm>
int x[10];
int main(){
	for(int i=0;i<10;++i){
		std::cin>>x[i];
	}
	std::sort(std::begin(x),std::end(x));
	for(int i=0;i<3;++i){
		std::cout<<x[9-i]<<std::endl;
	}
	return 0;
}

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

int main(){
    
    int i;
    int max1, max2, max3;
    std::array <int, 10> hill;
    
    max2 = 0;
    max3 = 0;

    for (i = 0; i < 10; ++i) {
        std::cin >> hill.at(i);
        
        if (i == 0) max1 = hill.at(0);
        
        if (max1 < hill.at(i)) { 
            max2 = max1;                    
            max1 = hill.at(i);
        } else if (max2 < hill.at(i)) {
            max3 = max2;
            max2 = hill.at(i);
        } else if (max3 < hill.at(i)) max3 = hill.at(i);
        else {}
    }
    
    std::cout << max1 << std::endl << max2 << std::endl << max3 << std::endl;
    
    return 0;
}