Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

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

int main()
{
	int mountains[10];
	int first = 0,second = 0,third = 0;

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

	cout << first << endl << second << endl << third << endl;

	return 0;
}

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

C++: // 2011/05/26 Tazoe

#include <iostream>
using namespace std;

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

	for(int i=0; i<9; i++)
		for(int j=i+1; j<10; j++)
			if(mnt[i]<mnt[j]){
				int tmp = mnt[i];
				mnt[i] = mnt[j];
				mnt[j] = tmp;
			}

	for(int i=0; i<3; i++)
		cout << mnt[i] << endl;

	return 0;
}

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

int main(){
	int n[100]={0};
	int h1=0, h2=0, h3=0;
	for(int i=0; i<10; i++) cin >> n[i];

	for(int i=0; i<10; i++){
		if( h1<n[i] ){
			h3=h2;
			h2=h1;
			h1=n[i];
		}else if( h2<n[i] ){
			h3=h2;
			h2=n[i];
		}else if( h3<n[i] ){
			h3=n[i];
		}
	}
	cout << h1 << "\n";
	cout << h2 << "\n";
	cout << h3 << "\n";
}

C++: #include <iostream>

using namespace std;

void reverse(int *array, int length) {
	int i;
	int j;
	for(i=0;i<length-1;i++){
		for(j=i+1;j<length;j++){
			if(array[i]<array[j]){
				int temp=array[i];
				array[i]=array[j];
				array[j]=temp;
			}
		}
	}
}

int main() {
	int mountain[10];
	for (int i = 0; i < 10; i++) {
		cin >> mountain[i];
	}
	reverse(mountain, 10);
	for (int i = 0; i < 3; i++) {
		cout << mountain[i] << endl;
	}
}

C++: //
// Created by Undefined on 2018/2/2.
//

#include <iostream>

using namespace std;

int main() {
    int a, b, c, tmp;
    a = b = c = 0;
    for (int i = 0; i < 10; i++) {
        scanf("%d", &tmp);
        if (tmp > a) {
            c = b;
            b = a;
            a = tmp;
        } else if (tmp > b) {
            c = b;
            b = tmp;
        } else if (tmp > c) {
            c = tmp;
        }
    }
    printf("%d\n%d\n%d\n", a, b, c);
    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int num = 0;
	int mountains[10];
	for (int i = 0; i < 10; i++){
		cin >> mountains[i];
	}
	sort(mountains,mountains+10);
	cout << mountains[9] << endl;
	cout << mountains[8] << endl;
	cout << mountains[7] << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int x, rank01,rank02,rank03 = 0;
    
    for(int i = 0; i < 10; i++){
        cin >> x;
        if(rank01 < x){
            rank03 = rank02;
            rank02 = rank01;
            rank01 = x;
        }
        else if(rank02 < x){
            rank03 = rank02;
            rank02 = x;
        }
        else if (rank03 < x){
            rank03 = x;
        }
       
       std::cout << rank01 << std::endl<< rank02 << std::endl << rank03 << std::endl; 
       
    }
}

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

int main(){
        int i;
        int high[10];
        for(i = 0; i < 10; i++){
                scanf("%d", &high[i]);
                getchar();
        }
        sort(high, high + 10);
        reverse(high, high + 10);
        for(i = 0; i < 3; i++){
                printf("%d", high[i]);
        }
        return 0;
}

C++: import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;


class Main{
	public static void main(String[] args)throws IOException{
		int[] height=new int[10];
		String[] st=new String[10];

		File file=new File("in1.txt");
		BufferedReader br=new BufferedReader(new BufferedReader(new FileReader(file)));

		for(int i=0; i<10; i++){
			st[i]=br.readLine();
			height[i]=Integer.parseInt(st[i]);

			if(height[i]<0){
				height[i]*=-1;
			}
		}

		int a=0;		//a uses bubble sort


		for(int j=0; j<9; j++){
			for(int k=9; k>j; k--){
				if(height[k]<height[k-1]){
					a=height[k];
					height[k]=height[k-1];
					height[k-1]=a;

				}
			}
		}

		try{
			PrintWriter pw=new PrintWriter
					(new BufferedWriter(new FileWriter("out1.txt")));

			for(int l=0; l<3; l++){
				pw.println(height[9-l]);
			}
			pw.close();
		}

		catch(IOException e){
			System.out.println("err");
		}
	}
}

C++: #include <iostream>
using namespace std;
int height[10];
void sort(int A[]);
void swap(int &a, int &b);
int main()
{
	int n = 10;
	for (int i = 0; i < 10; i++)
		cin >> height[i];
	sort(height);
	return 0;
}
void sort(int A[])
{
	int i, j, min;
	for (i = 0; i < 10; i++)
		min = i;
	for (j = i; j < 10; j++)
	{
		if(A[j] < A[min])
		{
			swap(A[j], A[min]);
			min = j;
		}
	}
	for (i = 0; i < 3; i++)
	{
		printf("%d\n", A[i]);
	}
}
void swap(int &a, int &b)
{
	int t = a;
	a = b;
	b = t;
}

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

int main() {
  
  char a[256];
  int mountain[9] = {};
  int lineCount = 0,n,t,j,temp;
  
  for(n=0;n<10;n++) {
    cin.getline(a,256);
    mountain[n] = stoi(a);
    //cout << mountain[n];
  }

  for(t=0; t<10; t++)
  {
    for(j=t; j< 9; j++)
    {
      if(mountain[t] < mountain[j+1] )
      {
        temp= mountain[t];
        mountain[t]= mountain[j+1];
        mountain[j+1]= temp;
      }
    }
  }
  
  for (int i=0; i<3; i++) {
    cout << mountain[i]<< endl;
  }
  
  return 0;
}

C++: #include<stdio.h>   

void func(float); 

int main(void) 
{
	float tai;
	
	while(scanf("%f",&tai)!=EOF)    { 
        	func(tai);
	}  
   	return 0;
}	 
	void func(float tai) 
	{     
	float lim[10]={48.0,51.0,54.0,57.0,60.0,64.0,69.0,75.0,81.0,91.0};   
  	char kai[11][13]={"light fly","fly","bantam","feather","light","light welter","welter","light","middle","light heavy","heavy"};    
 	int i;
       	
	for(i=0;i<10;i++)    {    
		if(lim[i]>=tai){  
			break;   
	      } 
	}     
	printf("%s\n",kai[i]);
}

C++: // 失敗するからこそ そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
#ifdef DAIJOBU
#include "/home/v-o_o-v/deb.h"
#define deb(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif 

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	vector<int> a(10);
	for(int i = 0; i < 10; i++){
		int x;
		cin >> x;
		a.push_back(x);
	}
	sort(a.rbegin(), a.rend());
	for(int i = 0; i < 3; i++)cout << a[i] << '\n';
	return 0;
}
// Write Here

C++: #include <iostream>

int main() {
    int num[10] = {1819
,2003
,876
,2840
,1723
,1673
,3776
,2848
,1592
,922};
    int max1=2;
    int max2=1;
    int max3=0;
    for (int i=0; i<10; i++) {
        if (max3 < num[i]) {
            if (max2 < num[i]) {
                if (max1 < num[i]) {
                    max1 = num[i];
                }
                else {
                    max2 = num[i];
                }
            }
            else {
                max3 = num[i];
            }
        }
    }
    
    std::cout << max1 << std::endl;
    std::cout << max2 << std::endl;
    std::cout << max3 << std::endl;
    return 0;
}