Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

C++: #include <iostream>
#include <cstdio> 
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#ifndef typeof
#define typeof __typeof__
#endif // typeof
 
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(typeof((c).rbegin()) i = (c).rbegin(); i != (c).rend(); i++)
#define repby(i, a, b, step) for(typeof(b) i = (a); i < (b); i += (step))
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  vi v;
  int x;

  while (cin >> x) {
    v.pb(x);
  }

  sort(rall(v));

  cout << v[0] << endl;
  cout << v[1] << endl;
  cout << v[2] << endl;

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main() {
	int a[10];
	for (int b = 0; b < 10; b++)cin >> a[b];
	sort(a, a + 10);
	for (int c = 9; c > 6; c--)printf("%d\n", a[c]);
}

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

using namespace std;

void Top3Mountains(int m1,int m2,int m3,int m4,int m5,int m6,int m7,int m8,int m9, int m10)
{
	deque<int> mountains;
	mountains.push_back(m1);
	mountains.push_back(m2);
	mountains.push_back(m3);
	mountains.push_back(m4);
	mountains.push_back(m5);
	mountains.push_back(m6);
	mountains.push_back(m7);
	mountains.push_back(m8);
	mountains.push_back(m9);
	mountains.push_back(m10);

	sort(mountains.begin(),mountains.end(),greater<int>());
	
	deque<int>::iterator it = mountains.begin();

	int i=0;
	for(i=0;i<3; i++){
		cout << *it << endl;
		it++;
	}

}

int main()
{

	Top3Mountains(1819,2003,876,2840,1723,1673,3776,2848,1592,922);
	return 0;
}

C++: #include<iostream>

using namespace std;


int main(){
  int height[10] = {};
  int i,j,temp;

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

  for(i=9;i>0;i--){
    for(j=0;j<i;j++){
      if(height[j]<height[j+1]){
	temp = height[j];
	height[j] = height[j+1];
	height[j+1] = temp;
      }
    }
  }


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

}

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

int main(){

??????vector<int> data;

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

    return 0;
}

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

int main(){
    int hest[3];
    for(int i=0,int h=0;i<10;i++){
        std::cin>>h;
        for(int j=0;j<3;j++){
            if(hest[i]<h){
                hest[i] = h;
            }
        }
    }

    for(int j=0;j<3;j++){
        std::cout<<hest[i]<<std::endl;
    }

    return 0;
}

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

int main(){

	int str[10];
	int tmp = 0;
	int max[3];

	for (int i = 0; i < 10; i++) {
		scanf("%d",str[i]);
	}
	
	for(int j =0; j < 10; j++) {
		if( max[0] < str[j] ) {
			max[0] = str[j];
		}
	}
	for(int j =0; j < 10; j++) {
		if( max[1] < str[j] & str[j] != max[0]) {
			max[1] = str[j];
		}
	}
	for(int j =0; j < 10; j++) {
		if( max[2] < str[j] & str[j] != max[0] & str[j] != max[1]) {
			max[2] = str[j];
		}
	}
	
	printf("%d\n",max[0]);
	printf("%d\n",max[1]);
	printf("%d\n",max[2]);
	
}

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, less<int>());
	cout << a[9] << endl;
	cout << a[8] << endl;
	cout << a[7] << endl;
}

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

int main() {

    int first = 0;
    int second = 0;
    int third = 0;
    int height;

    for(int i = 0; i < 10; i++) {
        cin >> height;
        if (height >= first) {
            third = second;
            second = first;
            first = height;
        } else if (height >= second) {
            third = second;
            second = height;
        } else if (height >= third) {
            third = height;
        }

    }

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

C++: #include<iostream>
#include<vector>
int main(){
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	int a=0;
	for(int i=0;i<10;i++){
		if(a<vec[i])a=vec[i];
	}
	std::cout<<a<<std::endl;
	int b=0;
	for(int i=0;i<10;i++){
		if(b<vec[i]&&vec[i]!=a)b=vec[i];
	}
	std::cout<<b<<std::endl;
	int c=0;
	for(int i=0;i<10;i++){
		if(c<vec[i]&&vec[i]!=a&&vec[i]!=b)c=vec[i];
	}
	std::cout<<c<<std::endl;
	return 0;
}

C++: #include <iostream>

using namespace std;
#define total 10


int main (void){

	int height[total];
	for(int i=0;i<total;i++){
		cin>>height[i];
		while(height[i]<0||height[i]>10000){
			cin>>height[i];
		}
	}
	int temp=0;
	for(int i=0;i<total;i++){
		for(int j=i+1;j<total;j++){
			if(height[i]<height[j]){
				temp=height[i];
				height[i]=height[j];
				height[j]=temp;
			}
		}
	}
	cout<<height[0]<<endl<<
		height[1]<<endl<<
		height[2]<<endl;
}

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

int main(){
	int max1 = 0, max2 = 0, max3 = 0, height;
	while(cin >> height) {
		if (height > max1) {
			max3 = max2;
			max2 = max1;
			max1 = height;
		}
		else if (height > max2) {
			max3 = max2;
			max2 = height;
		}
		else if (height > max3)
			max3 = height;
	}
	cout << max1 << endl;
	cout << max2 << endl;
	cout << max3 << endl;
	return 0;
}

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

int main(){
    int i, f, s, t, h;
    f = -1;
    s = -1;
    t = -1;
    for (i = 0; i < 10; i++) {
        scanf("%d", &h);
        if (h > f) {
        	t = s;
        	s = f;
        	f = h;
        }
        else if (h > s) {
        	t = s;
        	s = h;
        }
        else if (h > t) {
        	t = h;
        }
    }
    printf("%d\n%d\n%d\n", f, s, t);
    return 0;
}

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

using namespace std;

int main(){
  int i,j;
  int no1=0, no2=0, no3 = 0;
  int cur=0;
  for(i=0; i<10; i++){
    cin>>cur;
    if(cur>=no1){
      no3= no2;
      no2= no1;
      no1 = cur;
    }else if(cur>=no2){
      no3= no2;
      no2= cur;
    }else if(cur>=no3){
      no3= cur;
    }
  }
  cout << no1 << endl;
  cout << no2 << endl;
  cout << no3 << endl;

    return 0;
}

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

int main(){
	bool flag;
	int result[3],buf,temp[10];
	for(int i = 0; i < 10; i++){
		cin >> temp[i];
	}
	for(int l = 0; l < 3; l++){
		while(1){
			for(int j = l; j < 9; j++){
				if(temp[j] < temp[j+1]){
					buf = temp[j+1];
					temp[j+1] = temp[j];
					temp[j] = buf;
				}
			}
			flag = false;
			for(int k = l; k < 9; k++){
				cout << "reached!" << endl;
				if(temp[l] < temp[k]) flag = true;
			}
			if(flag != true){
				result[l] = temp[l];
				break;
			}
		}
	}
	cout << result[0] << endl;
	cout << result[1] << endl;
	cout << result[2] << endl;
	return 0;
}