Go: package main

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

var (
	n  = 10
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	heights := make([]int, n, n)
	for i := 0; i < n; i++ {
		sc.Scan()
		heights[i], _ = strconv.Atoi(sc.Text())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heights)))

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

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

int main()
{
    int height, First,Second,Third,index;
    First = Second = Third = 0;

    for(index=0; index<10; index++)
   {
      cin >> height;

      if(height > First)
      {
           Third = Second;
           Second = First;
           First = height;
      }
      else if(height > Second && height <= First)
      {
          Third = Second;
          Second = height;
      }
      else if(height > Third && height <= Second)
          Third = height;
    }


    cout << First << endl << Second << endl << Third << endl;

    return 0;
}

C++: #include <string>
#include <math.h>
#include <algorithm>
#include <iostream>
using namespace std;

int main() {
	long long 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] << endl;
	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int m[10];
	rep(i,10)
		cin>>m[i];
	sort(m,m+10);
	cout<<m[9]<<endl;
	cout<<m[8]<<endl;
	cout<<m[7]<<endl;
	return 0;
}

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

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

C++: #include<stdio.h>

int main(void){
    int ex,i,j,high[10];


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

    for(i = 0;i < 10;i++){
        for(j = i + 1;j < 10;j++){
            if(high[i] > high[j]){
                ex = high[i];
                high[i] = high[j];
                high[j] = ex;
            }
        }
    }

    printf("%d\n%d\n%d\n",high[9],high[8],high[7]);
    return 0;
}

C++: #include<bits/stdc++.h>
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>());
        for(int i=0;i<3;++i)cout<<v[i]<<endl;
        return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

using i64 = int64_t;

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

    return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
	int a[11];
	rep(i, 0, 10) cin >> a[i];
	sort(a, a + 10);
	repb(i, 9, 7){
		cout << a[i] << endl;
	}
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main()
{

		int a=0,b=0,c=0;
		int m;
		for(int i=1;i<=10;i++)
		{
			cin>>m;
			if(m>=a)
			{
				int temp;
				temp=b;
				b=a;
				c=temp;
				a=m;
				
			}
			else if(m>=b)
			{
				int z;
				c=b;
				b=m;
			}
			else if(m>=c)
			{
				c=m;
			}
			
		}
		cout<<a<<endl;
		cout<<b<<endl;
		cout<<c<<endl;
}

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

const static int MAX = 10000;

int main() {
    int R[MAX]={0};
    int e;

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

    int cnt = 0;
    for (int j = MAX - 1; j > 0 ; j--){

        if  (cnt >= 3) break;

        if (R[j] != 0){
            cout << R[j] << endl;
            cnt++;
        }
    }
    return 0;
}

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

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

using namespace std;

void Top3Mountains(int m[10])
{
	deque<int> mountains;
	if ( m[0] >= 0 && m[0] <= 10000 &&
		m[1] >= 0 && m[1] <= 10000 &&
		m[2] >= 0 && m[2] <= 10000 &&
		m[3] >= 0 && m[3] <= 10000 &&
		m[4] >= 0 && m[4] <= 10000 &&
		m[5] >= 0 && m[5] <= 10000 &&
		m[6] >= 0 && m[6] <= 10000 &&
		m[7] >= 0 && m[7] <= 10000 &&
		m[8] >= 0 && m[8] <= 10000 &&
		m[9] >= 0 && m[9] <= 10000 ){

			mountains.push_back(m[0]);
			mountains.push_back(m[1]);
			mountains.push_back(m[2]);
			mountains.push_back(m[3]);
			mountains.push_back(m[4]);
			mountains.push_back(m[5]);
			mountains.push_back(m[6]);
			mountains.push_back(m[7]);
			mountains.push_back(m[8]);
			mountains.push_back(m[9]);

			sort(mountains.begin(),mountains.end(),greater<int>());

			deque<int>::iterator it = mountains.begin();

			int i=0;
			for(i=0;i<3; i++){
				cout << *it << endl;
				it++;
			}
	}
	return;
}

int main()
{
	int m[10] = {1819,2003,876,2840,1723,1673,3776,2848,1592,922};

	Top3Mountains(m);
	return 0;
}

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

int main()
{
	vector <int> v;
	for (int i = 0; i < 10; i++){
		int h;
		cin >> h;
		v.push_back(h);
	}
	sort(v.begin(), v.end(), greater<int>());
	for (int i = 0; i < 3;i++){
		cout <<v[i] << endl;
	}
	

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
priority_queue <int> mountain;
int m;
int main()
{
    while(cin>>m) mountain.push(m);
    int i=3;
    while(i) {
        printf("%d\n", mountain.top());
        mountain.pop();
        i--;
    }
    return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[11],min1=-1,min2=-1,min3=-1, i,j,k,l;
	for (i = 1; i <= 10; i++) {
		cin >> a[i];
	}
	for (j = 1; j <= 10; j++) {
		if (a[j] > min1) {
			min1 = a[j];
		}
	}
	for (k = 1; k <= 10; k++) {
		if (a[k] > min2 && a[k]!=min1) {
			min2 = a[k];
		}
	}
	for (l = 1; l <= 10; l++) {
		if (a[l] > min3&&a[l]!=min2&&a[l]!=min1) {
			min3 = a[l];
		}
	}
	cout << min1 << endl << min2 << endl << min3  << endl;
	return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using   namespace   std;

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;
}

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

int main(){
	int nyuryoku,high,low,middle,flag;
	
	for(int i=0;i<10;i++){
	cin>>nyuryoku;
	if(flag==0){
	high = nyuryoku;
	}else{
	if(nyuryoku>low){
		if(nyuryoku>middle){
			if(nyuryoku>high){
				high = nyuryoku;
			}else{
				middle = nyuryoku;
			}low = nyuryoku;
		}
	}
	}
	cout<<highendl<<endl;
	cout<<middle<<endl;
	cout<<low<<endl;
return 0;
}

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

int main(){
  int t[10];

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

  for(int i = 9; i >= 7; i--){
    cout << t[i] << endl;
  }
}

C++: #include <stdio.h>
int main(){

	int a[10],i,j,k;

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

	for(i=0;i<10;i++){
		for(j=i+1;j<10;j++){
			if(a[i]<a[j]){
				k=a[i];
				a[i]=a[j];
				a[j]=k;
			}
		}
	}

	printf("%d%d%d",a[0],a[1],a[2]);

	return 0;
}