Go: package main

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

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

	sort.Slice(mountHeightList, func(i, j int) bool { return mountHeightList[i] > mountHeightList[j] })

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

C++: #include<stdio.h>
int main(){
	int l[10],r[10]={-1};
	int i,j,k,c[10]={11},n=0;
	for(i=0;i<10;i++){
		scanf("%d",&l[i]);
	}
	for(j=0;j<10;j++){
		for(i=0;i<10;i++){
			for(k=0;k<10;k++){
				if(c[k]==i){
					n=1;
				}
			}
			if(!(n==1)){
				if(l[i]>=r[j]){
					r[j]=l[i];
					c[j]=i;

				}
			}

			n=0;
		}
	}
	for(i=0;i<3;i++){
		printf("%d\n",r[i]);
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <cctype>
using namespace std;
int main(){
    string line;
    for(;getline(cin,line);){
        for(int i=0;i<line.size();i++)line[i]=toupper(line[i]);
        cout<<line<<endl;
    }
}

C++: //
//  main.cpp
//  Sample
//
//  Created by h3037183 on 2017/07/31.
//  Copyright ?? 2017??´ ?°????. All rights reserved.
//

#include <iostream>
#include<algorithm>
using namespace std;
int main(){
    int a[10],i;
    for(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>
using namespace std;
int main() {
int a[10];
int b;
for(int i=0;i<10;i++){
cin>>b;
a[i]=b;
}
sort(a,a+10,greater<int>());
cout<<a[0]<<endl;
cout<<a[1]<<endl;
cout<<a[2]<<endl;
return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int i,m[10],count,st = 10000;
	for(i = 0;i < 10;i++){
	scanf("%d",&m[i]);
	}
	while(count<3)
	{
		
		for(i = 0;i < 10;i++)
		{
			if(m[i] == st){
				printf("%d\n",m[i]);
				count++;
				break;
			}
		}
		st--;
	}
	return 0;
}

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int a[10];
  int i,k;
  for(i=0;i<10;i++){
    cin>>a[i];
  }
  for(i=9;i>0;i--){
    for(k=i-1;k>-1;k--){
      if(a[i]<a[k]) swap(a[i],a[k]);
    }
  }
  cout<<a[9]<<endl;
  cout<<a[8]<<endl;
  cout<<a[7]<<endl;
  return 0;
}

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

int main(){

??????int data[10];

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

    return 0;
}

C++: #include<iostream>

using namespace std;

//??\?????????
void swap(int *a, int *b){
	int temp = *a;
	*a = *b;
	*b = temp;
}

int main(){
	int str,mt[10];
	int i;
	
	for(i=0;i<10;i++){
		cin >> str;
		mt[i]=str;
	}
	
	// ????????????
	int num = 1;
	while(num<=3){
		str = mt[num-1];
		for(i=num;i<=10;i++){
			if(str<mt[i]){
				str = mt[i];
				swap(mt[num-1],mt[i]);
			}
		}
		num++;
	}
	
	cout << mt[0] << "\n";
	cout << mt[1] << "\n";
	cout << mt[2] << "\n";
	
	return 0;
}

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

using namespace std;

int main() {
  int h;
  vector<int> m;
  for(int i = 0; i < 10; i ++) {
    cin >> h;
    m.push_back(h);
  }

  sort(m.begin(), m.end());
  

  for(int i = 1; i <= 3; i ++) {
    cout << m[m.size()-i] << endl;
  }

  return 0;
}

C++: #include<stdio.h>

int main()
{
int x,t1,t2,t3;
t1=0;t2=0;t3=0;
for(int i=0;i<10;i++){
scanf("%d",&x);
if(x>t1){t3=t2;t2=t1;t1=x;}
else if(x>t2){t3=t2;t2=x;}
else if(x>t3)t3=x;
}
printf("%d\n%d\n%d\n",t1,t2,t3);

return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD 1000000007
 
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template <class T>
void print(T& x){printf("%d\n", x);}
void printvec(vector<int> a){
    rep(i, a.size()-1){
        printf("%d ", a[i]);
    }
    printf("%d\n", a[a.size()-1]);
}
 
int main()
{
    int first=0, second=0, third=0, tmp;
    while(scanf("%d", &tmp)!=EOF){
        if(tmp >= first){
            third = second;
            second = first;
            first = tmp;
        }else if(tmp >= second){
            third = second;
            second = tmp;
        }else if(tmp > third){
            third = tmp;
        }
    }

    printf("%d\n%d\n%d\n", first, second, third);
    return 0;
}

C++: #include <iostream>

int main(){
int a[10];
int max = 0;
int max2 = 0;
int max3 = 0;

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

for(int i = 0; i< 10; i++){
if(max < a[i]) max = a[i];
}

for(int i = 0; i< 10; i++){
if(max2 < a[i] && max != a[i]) max2 = a[i];
}

for(int i = 0; i< 10; i++){
if(max3 < a[i]&& max != a[i]&& max2 != a[i]) max3 = a[i];
}


return 0;
}

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

int main(){
    
    std::priority_queue<int> pq;
    int a;
    while(std::cin >> a) {
        pq.push(a);    }
    
    for (int i = 0; i < 3; ++i) {
        std::cout << pq.top() << "\n"; pq.pop();
    }
    
    return 0;
}

C++: #include<stdio.h>

int main(void) {

	int fnit[10];
	int i = 0;

	int top = 0;
	int second = 0;
	int third = 0;

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

	/* トップを求める処理 */

	top = fnit[0];

	for(i = 1; i <= 9; i++) {

		if( top < fnit[i] ) {
			third = second;
			second = top;
			top = fnit[i];
		}
		else if (second < fnit[i]) {
			third = second;
			second = fnit[i];
		}
		else if(third < fnit[i]) {
			third = fnit[i];
		}
	}

	/* --- */

	printf("%d\n", top);
	printf("%d\n", second);
	printf("%d\n", third);


	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++)
    {
        for (int n = 0; n < 9 - i; n++)
        {
            if (h[n] < h[n+1])
            {
                std::swap(h[n], h[n+1]);
            }
        }
    }
    
    for (int i = 0; i < 3; i++)
    {
        std::cout << h[i] << std::endl;
    }

    return 0;
}

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

#include <iostream>
#include <vector>
using namespace std;
int main() {
 
    int num;
    vector<int> list;
    while(cin)
    {
    cin >> num;
        list.push_back(num);
   
    }
    sort(list.begin(), list.end(), greater<int>());
    for(int i = 0 ; i< 3 ; i++)
    {
        cout<< list[i] <<endl;
    }
    
    
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int a[20];
	for(int i=0;i<10;i++)
		cin>>a[i];
	sort(a,a+10);
	for(int i=9;i>6;i--)
		cout<<a[i]<<endl;
	//system("pause");
	return 0;
}

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

int main()
{
	vector<int> data(10,0);
	
	for(int i=1;i<=10;i++) 
		cin >> data[i];
	
	sort(data.begin(),data.end(),greater<int>());
	
	for(int j=0;j<=2;j++)
		cout << data[j] << endl;
	
	return 0;
}