Go: package main

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

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func toInt(str string) int {
	n, _ := strconv.Atoi(str)
	return n
}

func main() {
	lst := make([]int, 0)
	for i := 0; i < 10; i++ {
		lst = append(lst, toInt(readLine()))
	}
	sort.Ints(lst)
	for i := 9; i > 6; i-- {
		fmt.Println(lst[i])
	}
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
 
int main(){
    vector<int> v;
    int num;
    for(int i = 0;i<10;i++){
        cin>>num;
        v.push_back(num);
    }
 
    sort(v.begin(),v.end(),greater<int>());
 
 
 
    for(int i = 0;i<3;i++)
        cout<<v.at(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];
	}
	sort(a,a + 10);
	cout << a[9] << endl << a[8] << endl << a[7] << endl;
	
	return 0;
}

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

int main(){
	int m,max=0,cen=-1,min=-2;
	cin >> m;
	max=m;
	cen=m;
	min=m;
	for(int i=1;i<10;i++){
		cin >> m;
		if(max<m){
			min=cen;
			cen=max;
			max=m;
		}
		else if(cen<=m){
			min=cen;
			cen=m;
		}
		else if(min<=m) min=m;
	}
	cout << max << endl;
	cout << cen << endl;
	cout << min << endl;

		return 0;
}

C++: #include<stdio.h>
int main(void){
        int point[20],count=0,putCount=0,Ans=0,PMAX,i,Delete;
        point[0]=0;
        printf("--入力--\n");
        while(count<=9){
                scanf(" %d",&point[count]);
                count++;
                }
        count--;
        PMAX=count;
        printf("\n--出力--\n");
        while(count>0){
                for(i=0; i<=PMAX; i++){
                        if(point[i]>=Ans){
                                Ans=point[i];
                                Delete=i;
                                }
                        }
                point[Delete]=0;
                if(putCount<3){
                printf("        %d\n",Ans);
                putCount++;
                }
                Ans=0;
                count--;
                }
        return 0;
}

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

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

using namespace std;

int main(void) {
	int mh[10];
	string str;

	for (int i = 0; i < 10; i++) {
		getline(cin, str);
		mh[i] = atoi(str.c_str());
	}

	int s = sizeof(mh) / sizeof(int) - 1;
	sort(&mh[0], &mh[s]);

	for (int j = s; j > s - 3; j--) {
		cout << mh[j] << endl;
	}

	return 0;
}

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

using namespace std;


int main()
{
    int tmp;
    vector<int> num;
    
    for (int i = 0; i < 10; i++)
    {
        cin >> tmp;
        num.push_back(tmp);
    }
    
    sort(num.begin(), num.begin() + 10);
    for (int i = 9; i >= 7; i--)
    {
        cout << num[i] << endl;
    }
    
    return 0;
}

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


using namespace std;

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

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

int Size = 10;

int main(void) {
    int height[Size];
    
    for(int i = 0; i < Size; ++i) {
        cin >> height[i];
    }
    sort(height, height + Size);
    for(int i = 1; i <= 3; ++i) {
        cout << height[Size - i] << endl;
    }
}

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

int main() {
	int height;
	int top[3]={0,0,0};
	for(int i=0; i<10; i++){
		cin >> height;
		
		for(int j=0; j<3; j++){
			if(top[j]<=height){
				for(int k=2; k>j; k--){
					top[k]=top[k-1];
				}
				top[j]=height;
				break;
			}
		}
		
	}
	
	for(int i=0; i<3; i++){cout << top[i] << endl;}
	return 0;
}

C++: # include <iostream>
using namespace std;
void main(){
	for(int i =1;i<=9;i++){
		for(int j=1;j<=9;j++){
			cout <<i<<"x"<<j<<"="<<i*j<<"\n";
		}
	}
}

C++: //
//  main.cpp
//  ListOfHeights
//
//  Created by James Hosken on 28/09/2014.
//  Copyright (c) 2014 James Hosken. All rights reserved.
//

#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;

int main(int argc, const char * argv[])
{
    
    string input_line;
    
    int *heights;
    heights = new int[0];
    int lineNum = 0;
    
    
    while(cin){
        getline(cin, input_line);
        lineNum++;
        
        //Chunk of array expansion code
        int line = atoi(input_line.c_str());
        int* temp = new int[lineNum];
        copy(heights, heights + lineNum-1, temp);
        delete [] heights;
        temp[lineNum-1] = line;
        heights = temp;
        
        
    }
    sort(heights, heights + lineNum);
    
    for(int i = 0; i < lineNum; i++){
        cout << heights[i] << " & I = " << i << endl;
    }

    
    
    
    return 0;
}

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

int main()
{
    vector<int> v(10);
    for(int i=0;i<10;i++) cin >> v[i];
    sort(v.rbegin(),v.rend());
    for(int i=0;i<3;i++) cout << v[i] << endl;
    return 0;
}

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

int main(int argc, char* argv[]) {
  int h1=0, h2=0, h3=0, h;
  for(int i=1;i<11;i++){
    cin >> h;
    if(h>h3){
      h3 = h;
      if(h3>h2){
        swap(h3, h2);
        if(h2>h1){
          swap(h2, h1);
        }
      }
    }
  }
  cout << h1 << endl;
  cout << h2 << endl;
  cout << h3 << endl;

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
vector<int> heights;
int input;
 
int main(){
 while(cin >> input) heights.push_back(input);
 sort(heights.begin(), heights.end());
 auto itr = heights.end()-1;
 cout << *itr << "\n" << *(itr-1) << "\n" << *(itr-2) << endl;
 
 return 0;
}

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

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

}

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

int main(){

unsigned short mt_list[10];

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

unsigned short high[3] = {0};
for(int h=0; h<3; h++){
for(int i=0; i<10; i++){
if(high[h] >= mt_list[i]){
high[h] = i;
}
}
unsigned short tmp = high[h];
high[h] = mt_list[tmp];
mt_list[tmp] = 0;
}

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

return 0;
}

C++: #define _CRT_SECURE_NO_DEPRECATE
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 10000;
int a[MAXN + 10];
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int p = 0;
	while (scanf("%d", &a[p++])!=EOF);
	sort(a, a + p,cmp);
	printf("%d\n%d\n%d\n", a[0], a[1], a[2]);
	return 0;
}

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