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 <algorithm>
using namespace std;
int insertionSort(int a[],int n)
{
	for(int i=0;i<n;i++)
	{
		int j=i-1;
		int min=a[i];
		while(a[j]>min&&j>=0)
		{
			a[j+1]=a[j]; 
			j--;	
		}
		a[j+1]=min;
	}
 } 
int main()
{
	int x[10];
	for(int i=0;i<10;i++)
		cin>>x[i];
	insertionSort(x,10);	
	for(int i=9;i>=7;i--)
	cout << x[i] << endl;	
	return 0;
}

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

int main()

{
    int ar[11];
    int i,j;
    for(i=0;i<10;i++)
        scanf("%d",&ar[i]);
    sort(ar, ar+10);
    for(j=9;j>6;j--){
        printf("%d\n",ar[j]);
    }

    return 0;
}

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

using namespace std;
int main()
{
    int a[100],i;
    int n=10;
    scanf("%d",&n);

    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
     printf("%d\n%d\n%d\n",a[n-1],a[n-2],a[n-3]);
    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];
  }
  sort(a, a+ 9);
  printf("%d\n", a[9]);
  printf("%d\n", a[8]);
  printf("%d\n", a[7]);
}

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

using namespace std;

int main()
{
	int deta[11];

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

	sort (deta, deta + 10);

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

	return 0;
}

C++: #include <cstdio> #include <algorithm> using namespace std; int main(void){ int a[10]; int 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>
#include <algorithm>
using namespace std;

void sort(int* begin, int* end) {
    std::sort(begin, end);
}

int high[10];

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

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

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

C++: #include<stdio.h>
int main (void){
    int x1=0,x2=0,x3=0,input,s;
    for(s=0;s<10;s++){
        scanf("%d\n",&input);
        if(x1 < input){
            x3 = x2;
            x2 = x1;
            x1 = input;
        }else{
            if(x2 < input){
                x3 = x2;
                x2 = input;
            }else{
                if(x3 < input){
                    x3 = input;
                }
            }
        }
    }
    printf("%d\n%d\n%d\n",x1,x2,x3);
    return(0);

C++: #include<stdio.h>
int main(){
	int list[10];
	int lank[3]={-1},chk[3]={11},f=0,ch=11;
	for(int i=0;i<10;i++){
		scanf("%d",&list[i]);
	}
	for(int c=0;c<3;c++){
		for(int i=0;i<10;i++){
			for(int j=0;j<3;j++){
				if(chk[j]==i){
					f=1;
				}
			}
			if(f==1){
				f=0;
			}else{
				if(lank[c]<=list[i]){
					lank[c]=list[i];
					ch=i;
				}
			}
		}
		chk[c]=ch;
	}
	for(int c=0;c<3;c++){
		printf("%d\n",lank[c]);
	}
	return 0;
}

C++: #include <stdio.h>

int main(void) {
	int n;
	n=0;
	
	if (n<0 && n>10000)
	{
		return 1;
	}
	
	for(n=0; n<10 ;n++)
	{
		printf("height of mountain %d\n", %n);
	}
	
	return 0;
}

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

using namespace std;

int main(){

    ifstream ifs("in1.txt");

    int i;
    int height[3]={};
    int tmp, tmp2;
    string str;

    //while(getline(ifs,str)){
    while(cin >> str){
        sscanf(str.c_str(),"%d",&tmp);
        if(0<=tmp && tmp <=10000){
            for(i=0;i<3;i++){
                if(height[i] < tmp){
                    tmp2 = height[i];
                    height[i] = tmp;
                    tmp = tmp2;
                }
            }
        }
    }

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

    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int x, buf, i, j;
  int top[3];
  for(i = 0; i < 3; i++)
    top[i] = 0;

  for(i = 0; i < 10; i++){
    cin >> x;
    if(x > top[2]){
      top[2] = x;
      j = 2;
      while(j > 0){
        if(top[j-1] <top[j]){
          top[j-1] = buf;
          top[j-1] = top[j];
          top[j] = buf;
          j--;
        }else{
          break;
        }
      }
    }
  }

  for(i = 0; i<3; i++)
    cout << top[i] << '\n';

  return 0;
}

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

int main(){
	int a,b,c,x;

	for(int i=0;i<=9;i++){
		cin >> x;

		if(x>=a){
			c=b;
			b=a;
			a=x;
		}else if(x>=b){
			c=b;
			b=x;
		}else if(x>=c){
			c=x;
		}
	}

	cout << a << endl;
	cout << b << endl;
	cout << c << endl;

	return 0;
}

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

using namespace std;

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

    for(i=0;i<10;i++)
    {
        scanf("%d",&height[i]);
    }
    sort(height, height+10);

    for(j=0;j<3;j++)
    {
        printf("%d\n",height[9-j]);
    }
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
    long long int i,arr[10000];

   for(i=0;i<10;i++)
       cin>>arr[i];
       sort(arr,arr+10);
   for(i=9;i>=7;i--)
       cout<<arr[i]<<endl;

}

C++: file:///home/ooki/AOJ/top3.c

C++: 
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];
	cout << x[8];
	cout << x[7];
	
}

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

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

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

int main() {
	int i, j, a[10] = {0}, temp;
	for (i = 0; i < 10; i++) {
		cin >> a[i];
	}
	for (i = 0; i < 10; i++) {
		for(j = i; j < 10; j++) {
			if (a[j] < a[i]) {
				temp = a[j];
				a[j] = a[i];
				a[i] = a[j];
			}
		}
	}
	for (i = 9; i > 6; i--) {
		cout << a[i] << endl;
	}
	return 0;
}

C++: #include<iostream>

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

	for(i=0;i<10;i++){
		std::cin>>a[i];
		}
	for(i=0;i<10;i++){
	for(n=0;n<10;n++){
		if(a[n]<a[n+1]){
			b=a[n];
			a[n]=a[n+1];
			a[n+1]=b;
			}
		}
		}
	for(i=0;i<3;i++){
		std::cout<<a[i]<<std::endl;
		}

	return 0;
	}

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

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

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

int main() {
	// your code goes here
	vector<int> mountain;
	int x;
	for(int i=0;i<10;i++){
		cin >> x;
		mountain.push_back(x);
	}
	sort(mountain.begin(),mountain.end(),greater<int>());
	for(int i=0;i<3;i++)
	cout << mountain[i] << endl;

	return 0;
}

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

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