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 <iostream>
#include <vector>
#include <algorithm>

using namespace std;
int main() {
	vector<int> v;
	for(int i = 0; i < 10; ++i) {
		int n;
		cin >> n;
		v.push_back(n);
	}

	partial_sort(v.begin(), v.begin() + 3, v.end()
		, [](const int& x, const int& y) { return x > y;});
	
	for_each(v.begin(), v.begin() + 3, [](int x) {
		cout << x << endl;
	});
}

C++: #include<stdio.h>

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

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<stdio.h>
#include<algorithm>

using namespace std;

int main() {
	int m[10];

	for (int i = 0; i < 10; i++)scanf("%d", &m[i]);

	std::stable_sort(m, m + 10);
	
	for(int i=9;i>6;i--)printf("%d\n", m[9]);

	return 0;
}

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

int main() {
	int high[10];
	for(int i=0;i<10;i++){
		cin>>high[i];
	}
	sort(high,high+10);
	for(int i=9;i>=7;i--){
		cout<<high[i]<<endl;
	}
	return 0;
}

C++: #include <stdio.h>

int main(void){
    int a[3] ={0}, i, x;
    for (i = 0; i<=9; i++){
        scanf("%d", &x);
        if(a[0] < x){
            a[2] = a[1];
            a[1] = a[0];
            a[0] = x;
        }
        else if(a[1] < x){
            a[2] = a[1];
            a[1] = x;
        }
        if (a[2] < x && a[1] > x){
            a[2] = x;
        }
    }

    printf("%d\n%d\n%d\n", a[0], a[1], a[2]);

    return 0;
}

C++: #include <cstdio>
int main(){
 int top3[3];
 int i,tmp,data;
 for(i=0;i<3;i++) top3[i]=0;
 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>
#include <algorithm>
using namespace std;
int main(void){
  int i,list[10];
  for(i=0;i<10;i++){
     cin >> list[i];
  }
  sort(list,list+10);
  for(i=0;i<3;i++){
     cout << list[9-i] << endl; 
  }
    return 0;
}

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

using namespace std;

int main(){

	int h[10];

	for (int i = 1; i <= 9; i++){
		cin >> h[i];
	}

	sort(h,h+10);

	for (int i = 9; i > 6; i--){
		cout << h[i] << endl;
	}

	return 0;
}

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

C++: v=[];v<<$_.to_i while gets
3.times{|i|p v.sort.reverse[i]}

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

int main()
{
	int i, h;
	int mh[3] = {0};

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

		cin>>h;
		if(0<=h && h<=10000)
		if(mh[0] < h) mh[0] = h;
		else if(mh[1] < h) mh[1] = h;
		else if(mh[2] < h) mh[2] = h;

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

	cin.sync(); 
    cin.get();

	return 0;
}

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

using namespace std;

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

	sort(h, h + 10);

	for (int i = 9; i > 6; --i) {
		cout << h[i] << endl;
	}
}

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

using namespace std;

int main() {
    array<int,10> ar;
    for(int i=0;i<10;i++){
        int height;
        cin >> height;
        ar[i]=height;
        }
    sort(ar.begin(),ar.end());
    for(int j=0;j<3;j++){
        cout << ar[j] << endl;
        
    }
}

C++: #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
int main() {
    int a[10];
    for(int i=0;i<10;i++){
        cin >> a[i];
    }
    for (int i=0; i<10; i++) {
        for(int j=9;j>i;j--){
            if(a[j]>a[j-1]){
                swap(a[j], a[j-1]);
            }
        }
    }
    cout << a[0] <<endl<< a[1]<< endl<<a[2] <<endl;
    return 0;
}

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

using namespace std;

int main() {
  int a;
  vector<int> A(3);
  while(cin >> a) {
    if(A[0] < a) {
      if(A[1] < a) {
        if(A[2] < a) {
          swap(A[2],a);
        }
        swap(A[1], a);
      }
      swap(A[0], a);
    }
  }
  for(int i = 2; i >= 0; i--) {
    cout << A[i] << endl;
  }
 
  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];
	}
	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 9; j++ ){
			if(a[j] > a[j+1]){
				swap(a[j],a[j+1]);
			}
		}
		cout << a[9-i] << endl;
	}
	
	return 0; 
}

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

using namespace std;

int main(void)
{
	int input[10];

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


	for(int i = 3; i < 10; i++){
		for(int j = 0; j < 3; j++){
			if(input[i] > input[j]){
				input[j] = input[i];
				break;
			}
		}
	}

	sort(input, input+3, less<int>());

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


	return 0;
}

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

C++: #include<iostream>

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

		for(i=0;i<10;i++){
			std::cin>>Hills[i];
			}
        for(i=0;i<9;i++){
			for(j=i+1;j<10;j++){
				if(Hills[i]<Hills[j]){
					n=Hills[i];
					Hills[i]=Hills[j];
					Hills[j]=n;
					}
				}
			}

		for(i=0;i<3;i++){
			std::cout<<Hills[i]<<std::endl;
			}
return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<functional> 

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

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> v;
  int h;
  while (cin >> h) {
    v.push_back(h);
  }
  sort(v.begin, v.end);
  int s = v.size();
  cout << v[s-1] << endl << v[s-2] << endl << v[s-3] << endl;
}

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

int A[11];

int main() {
    for (int i = 0; i < 10; i++) {
        scanf("%d", &A[i]);
    }
    for (int i = 0; i < 3; i++) {
        int max_val = A[i];
        for (int j = i+1; j < 10; j++) {
            if (max_val < A[j]) std::swap(max_val, A[j]);
        }
        A[i] = max_val;
    }
    for (int i = 0; i < 3; i++) {
        printf("%d\n", A[i]);
    }
    return 0;
}

C++: //
//  main.cpp
//  AOJ_V0_0001
//
//  Created by anzai on 2015/08/06.
//  Copyright (c) 2015??´ anzai. All rights reserved.
//

#include<iostream>
using namespace std;

int main(){
    
    int array[10] = {0};
    
    for (int i = 0; i < 10; i++) {
        cin >> array[i];
        
    }
    int first = 0;
    int second = 0;
    int third = 0;
    for (int i = 0; i < 9; i++) {
        if (first <= array[i]) {
            first = array[i];
            
        }
        else if ((second <= array[i]) && (second != first )){
            second = array[i];
            
        }
        else if ((third <= array[i]) && (third != second ) && (third != first)){
            third = array[i];
        }
    }
    cout << first << endl;
    cout << second << endl;
    cout << third << endl;
    
    return 0;
}