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 <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	VI a(10);
	rep(i, 10)cin >> a[i];
	SORT(a); REVE(a);
	rep(i, 3)cout << a[i] << endl;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int ma=0;
    int ma_2=0;
    int ma_3=0;
    int*A=new int[10];
    for(int c=0;c<10;c++)
    {
        cin>>A[c];
        if(ma<A[c])
        {
            ma_3=ma_2;
            ma_2=ma;
            ma=A[c];
        }
        else
        {
            if(ma_2<A[c])
            {
                ma_3=ma_2;
                ma_2=A[c];
            }
            else
            {
                if(ma_3<A[c])
                ma_3=A[c];
            }
        }
    }
    cout<<ma<<endl;
    cout<<ma_2<<endl;
    cout<<ma_3<<endl;
    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];
}

std::cout << max<< std::endl;
std::cout << max2<< std::endl;
std::cout << max3<< std::endl;


return 0;
}

C++: //28
#include<iostream>
#include<algorithm>
#include<functional>

using namespace std;

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

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <queue>
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ll も int も longlongにしてしまう
    #define int long long

    // intを要素に持つ優先順位付きキュー
    std::priority_queue<int> que;

    int height;
    while (cin >> height) {
        que.push(height);
    }
    
    for (int i = 0; i < 3; i++) {
        cout << que.top() << endl;
        que.pop();
    }

    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <sstream>
#include <complex>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;

#define REP(i,s,t) for(int i=(s);i<(t);i++)
#define FILL(x,v) memset(x,v,sizeof(x))

const int INF = (int)1E9;
#define MAXN 100005


int main(){
	int h[10];
	REP(i,0,10) cin >> h[i];
	sort(h,h+10,greater<int>());
	REP(i,0,3) printf("%d\n", h[i]);
	return 0;
}

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

using namespace std;
int main(){
  int b[10];
  int a;
  for(int i=0; i < 10; i++){
    cin >> a;
    b[i] = a;
  }
  sort(b,b+10);
  for(int j=10; j > 7; j--){
    cout  << b[j-1]  << endl;
  }
}

C++: #include<stdio.h>
int main(void) {
	int i, mountain[10];
	int n = 0;
	int l = 0;
	int m = 0;
	for (i = 0;i < 10;i++) {
		scanf("%d", &mountain[i]);
	}
	for (i = 0;i < 10;i++) {
		if (mountain[i] > m) m = mountain[i];
	}
	printf("%d\n", m);
	for (i = 0;i < 10;i++) {
	if (mountain[i] > n && mountain[i] != m) n = mountain[i];
	}
	printf("%d\n", n);
	for (i = 0;i < 10; i++) {
		if (mountain[i] > l && mountain[i] != m && mountain[i] != n) l = mountain[i];
	}
	printf("%d\n", l);

	return 0;
}

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

int main(void) {
    int a[10];
    int i;
    for (i = 0; i < 10; i++) {
        cin >> a[i];
    }
    sort(a, a + 10);
    for(i = 0; i < 3; i++) {
        cout << a[9 - i] << endl;
    }
    return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;
priority_queue<int> q1;
int main(){
	int i,j;
	for(i=0;i<10;i++){
		cin>>j;
		q1.push(j);
	}
	for(i=0;i<3;i++){
		cout<<q1.top()<<endl;
		q1.pop();
	}
	return 0;
}

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

int main()
{
    
    int i = 10,m[10];
    
    while(i>0){
        cin >> m[i];
        i--;
    }
    
    int max,index,j;
   
    for(j = 0;j < 3 ; j++){
        max = m[0];
        index = 0;
        for(i = 0; i < 10 ;i++){
            if(max < m[i])
            {
                max = m[i];
                index = i;
            }
        }
        cout << m[index] << endl;
        m[index] = 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.begin(),v.end(),greater<int>());
   cout << v[0] << endl;
   cout << v[1] << endl;
   cout << v[2] << endl;
}

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

priority_queue<int> q;

int main(){
	int n;
	while(cin>>n) q.push(n);
	cout<<q.top()<<endl;
	q.pop();
	cout<<q.top()<<endl;
	q.pop();
	cout<<q.top()<<endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
int l[3] = {};
int a[10];
void sort() {
	int b;
	if (l[2] < l[1]) {
		b = l[1];
		l[1] = l[2];
		l[2] = b;
	}
	if (l[1] < l[0]) {
		b = l[1];
		l[1] = l[0];
		l[0] = b;
	}
	if (l[2] < l[1]) {
		b = l[1];
		l[1] = l[2];
		l[2] = b;
	}
}
int main()
{
	for (int i = 0; i < 10; i++)cin >> a[i];
	for (int i = 0; i < 10; i++) {
		for (int j = 0; j < 3; j++) {
			if (l[j] < a[i]) {
				l[j] = a[i];
				sort();
				break;
			}
		}
	}
	for (int j = 2; j >=0; j--) {
		cout << l[j] << endl;
	}
    return 0;
}

C++: #include <iostream>
#include <array>
#include <algorithm>
   
int main(){
    std::array<u_int, 10> heights;
      
    for (int i = 0; i < 10; ++i){
        std::cin >> heights[i];
    }
      
    std::sort(heights.begin(), heights.end(), std::greater<u_int>());
      
    for (int i = 0; i < 3; ++i){
        std::cout << heights[i] << std::endl;
    }
     
    return 0;
}

C++: #include<stdio.h>

int main(void)
{
	int x,y;

	for(x=1;x<=9;x++)
	{
		for(y=1;y<=9;y++)
		{
			printf("%dx%d=%d\n",x,y,x*y);
		}
	}
	return 0;
}