Go: package main

import "fmt"

func main() {
	var height int
	topHeights := [5]int{}

	for i := 0; i < 10; i++ {
		fmt.Scan(&height)

		for j := 0; j < 3; j++ {
			if topHeights[j] < height {
				topHeights[j+2] = topHeights[j+1]
				topHeights[j+1] = topHeights[j]
				topHeights[j] = height
				break
			}
		}
	}

	for i := 0; i < 3; i++ {
		fmt.Println(topHeights[i])
	}
}

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(){
 int a,b,c,d,a_max,N[10];

   for(a=0;a<10;a++){ 
   scanf("%d",&N[a]);
       }

     for(b=0;b<10;b++){ 
        b=a_max;
           for(c=b;c<10;c++){ 
              if(a_max<c){c=a_max;
                    }  
                  d=c; c=a_max; a_max=d; 
                       }

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

return 0;
}

C++: //
//  main.cpp
//  kyougi
//
//  Created by 寺林 一旭 on 2018/08/27.
//  Copyright © 2018年 寺林 一旭. All rights reserved.
//

#include <iostream>
int main(int argc, const char * argv[]) {
 
    int n = 0;
    while(std::cin >> n)
    {
    std::string str;
    getline(std::cin, str);
    std::cin.ignore();
        std::cout << str << std::endl;
    }
    
    
    
    return 0;
}

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

using namespace std;

int main()
{
    priority_queue<int> qu;
    int n;
    for( int i = 0; i < 10; i++){
        cin >> n;
        qu.push(n);
    }

    for( int i =0; i < 3; i++){
        cout << qu.top()<< endl;
        qu.pop();
    }

    return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n[10];
  for(int i = 0; i < 10; i++) cin >> n[i];
  sort( n, n+10, greater<int>());
  cout << n[0] << endl;
  cout << n[1] << endl;
  cout << n[2] << endl;
  return 0;
}

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

using namespace std;

int main()
{
    int i, a, b, c, height[12];

    for(i=1; i<=10; i++)
        cin>>height[i];

    sort(height+1, height+11);

    for(i=10; i>=8; i--)
        cout<<height[i]<<endl;

    return 0;
}

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

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int a[10],b=0,c=0,d[3],e=0;

  while(cin >> a[b]){
    if(b==10)break;
    b++;
  }

  sort(a,a+10);

  for(e=9;e!=6;e--){
    cout << a[e] <<endl;
  }
}

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

using namespace std;

int main(void){

  int mountain[10];

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

  sort( mountain , mountain + 10 );

  cout << mountain[9] << endl << mountain[8] << endl; <<mountain[7] << endl;

  return 0;
}

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

#define INPUTSIZE 10

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

    sort(inputs, inputs + INPUTSIZE);

    for (int i = 1; i <= 3; i++) cout << inputs[INPUTSIZE - i] << endl;

    return 0;
}

C++: #include <iostream>

auto main() -> int {
    for (int x = 1; x <= 9; x++) {
        for (int y = 1; y <= 9; y++) {
            std::cout << x << "x" << y << "=" << (x*y) << std::endl;
        }
    }
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#define sf scanf
#define pf printf
using namespace std;
int main()
{
    int ar[11];
    for(int i = 0; i<=9; i++)
    {
        sf("%d", &ar[i]);
    }

    sort (ar, ar+10);
    for(int i = 9; i>=7; i--)
    {
        pf("%d\n", ar[i]);
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <ctime>
#include <iterator>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;


int main()
{
    vector<int> v(10000,-1);
    int i=0;
    int tmp;
    while(cin>>tmp)
    {
        v[i++]=tmp;
    }
    sort(v.rbegin(),v.rend());
    cout<<v[0]<<endl<<v[1]<<endl<<v[2]<<endl;
}

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;
	cout<<a[8]<<endl;
	cout<<a[7];
     return 0;
}

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

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

	ans[0] = 0; ans[1] = 0; ans[2] = 0;
	for(int j=0; j<10; j++) {
		if(m[ans[0]] < m[j]) {
			ans[0] = j;
		}
	}
	for(int j=0; j<10; j++) {
		if(m[ans[1]] < m[j] && ans[0] != j) {
			ans[1] = j;
		}
	}
	for(int j=0; j<10; j++) {
		if(m[ans[2]] < m[j] && ans[0] != j && ans[1] != j) {
			ans[2] = j;
		}
	}
	printf("%d\n%d\n%d\n", m[ans[0]], m[ans[1]], m[ans[2]]);
	return 0;
}

C++: #include <iostream>

int main ()
{
	int h[10]{};

	for (int i = 0; i < 10 ; i++) {
		std::cin >> h[i];
	}
	for (int i = 0; i < 9; i++) {
		int pv = h[i];
		int k = i;
		for (int j=i+1 ; j<10 ; j++){
			if (h[j] < pv) {
				pv = h[j];
				k = j;
			}
		}
		int sw = h[i];
		h[i] = h[k];
		h[k] = sw;
	}
	std::cout << h[9] << std::endl;
	std::cout << h[8] << std::endl;
	std::cout << h[7] << std::endl;
}

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

C++: inputs = []

10.times do
  inputs << gets.to_i
end

puts inputs.sort.reverse[0..2]

C++: #include<stdio.h>

int main(){
int i,j,yama[10],temp;
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<iosteam>

int main(){
    int a[10], i, j ,n;
    for(i=0;i<10;i++){
        cin>>a[i];
        }
        
        for(i=0;i<10;i++){
        	for(j=i+1;j<10;j++){
        		if(a[i]<a[j]){
			n=a[i];
			a[i]=a[j];
			a[j]=n;
			}
		}	
	}
	for(i=0;i<3;i++){
	cout<<a[i]<<endl;
	}       	
	
	return 0;
}

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

int main(){
	vector<int> data;
	for(int i=0;i<10;++i){
		int a;
		scanf("%d",&a);
		data.push_back(a);
	}
	sort(data.begin(),data.end());
	vector<int>::iterator it = data.end();
	--it;
	for(int i=0; i < 3 ; --it, ++i)
		printf("%d\n",*it);
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
  vector<int> n;
  int k;
  for(int i=0; i<10; i++){
    cin >> k;
    n.push_back(k);
  }
  sort(n.begin(), n.end());
  cout << n[9] << "\n" << n[8] << "\n" << n[7] << endl;
  return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input;
int first;
int second;
int third;

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


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

}

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

using namespace std;

int main()
{
	int i, num;
	deque<int> mountainheight;
	for ( i = 0; i < 10; i++ ) {
		scanf("%d",&num);
		mountainheight.push_back(num);
	}
	sort( mountainheight.begin(), mountainheight.end(), greater<int>() );

	deque<int>::iterator it = mountainheight.begin();
	for( i = 0; i < 3; i++ ) {
		cout << *it << endl;
		it++;
	}

	return 0;
}