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>
#include <vector>
using namespace std;

int main(){
    vector<int> heights(10);;
    for(int i = 0; i < 10; ++i){
        cin >> heights[i];
    }
    sort(heights.begin(), heights.end(), greater<int>());

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

    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int h[10];
	int i, j;
	
	for (i = 0; i < 10; i++){
		scanf("%d", &h[i]);
	}
	
	for (i = 0; i < 9; i++){
		for (j = 0; j < 9 - i; j++){
			if (h[j] < h[j + 1]){
				h[j] += h[j + 1];
				h[j + 1] = h[j] - h[j + 1];
				h[j] -= h[j + 1];
			}
		}
	}
	
	for (i = 0; i < 3; i++){
		printf("%d\n", h[i]);
	}
	
	return (0);
}

C++: #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 999999999
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FFOR(i,a,b) for (int i=(a);i>(b);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define SORT(c) sort((c).begin(),(c).end())
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> Vi;
int a[10];
int main(){
  REP(i,10){
	  cin>>a[i];
  }
  SORT(a);
  FFOR(i,9,6){
	  cout<<a[i]<<endl;
  }
  return 0;
}

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

#include <algorithm>

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

C++: #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
	int tall[10],i,j,box;
	for(i=0;i<10;i++){
		scanf("%d",&tall[i]);
	}
	for(i=0;i<9;i++){
		for(j=i+1;j<10;j++){
			if(tall[i]<tall[j]){
				box=tall[j];
				tall[j]=tall[i];
				tall[i]=box;
			}
		}
	}for(i=0;i<3;i++){
		printf("%d\n",tall[i]);
	}
	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;
		}else{	
			low = nyuryoku;
		}
		}
	}
}
	cout<<high<<endl;
	cout<<middle<<endl;
	cout<<low<<endl;
return 0;
}

C++: #include<stdio.h>
int main(void){
	int d, m1 = 0, m2 = 0, m3 = 0, i;{
	scanf("%d", &d);
		for(i=1;i<10;i++){
			scanf("%d", &d);
			if(d > m1){
			m3 = m2;
			m2 = m1;
			m1 = d;
				}else if(d > m2){
				m3 = m2;
				m2 = d;
					} else if(d > m3){
					m3 = d;
					}
		}
	printf("%d\f""%d\f""%d\f", m1, m2, m3);
	return 0;
	}
}

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

int main(){
  int n = 10, m = 3;
  int ans[m];
  memset(ans, 0, sizeof(ans));

  for(int i = 0; i < n; i++){
    int x;
    cin >> x;

    for(int j = 0; j < m; j++){
      if(x > ans[j]){
        for(int k = m - 1; k > j; k--){
          ans[k] = ans[k - 1];
        }
        ans[j] = x;
        break;
      }
    }
  }

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

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

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

    int n1=0;
    int n2=0;
    int n3=0;
    int h;
    while(cin >> h){
        int tmp;
        if(h>n3) n3=h;
        if(n3>n2){
            tmp=n2;
            n2=n3;
            n3=tmp;
        }
        if(n2>n1){
            tmp=n1;
            n1=n2;
            n2=tmp;
        }
    }
    
    cout << n1 << endl;
    cout << n2 << endl;
    cout << n3 << endl;
    
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
__int128_t a[15];
 
int main(){
    for(int i=0;i<10;i++){
        cin>>a[i];
    }
    sort(a, a+10);
    cout<<a[9]<<endl
        <<a[8]<<endl
        <<a[7]<<endl;
}

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

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;(i)>=0;(i)--)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())

typedef long long ll;

int main(){
    vector<int> h(10);
    REP(i,10)cin>>h[i];
    sort(h.begin(),h.end());
    cout<<h[9]<<endl<<h[8]<<endl<<h[7]<<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);
for(int i=9;i>6;i--)cout << a[i] << endl;
}

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

int main(){

	vector<int> height(10,0);

	for(int i=0; i<10; i++)
		cin >> height[i];
	sort(height.begin(), height.end());

	for(int i=9; i>6; i--)
		cout << height[i] << endl;

	return 0;
}

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

int main()
{
	int x, i, n;
	i = 1;
	cin >> n;
	3 <= n <= 10000;
	while (i <= n)
	{
		x = i;
			if (x % 3 == 0)
			{
				cout << " " << i;
			}
			else if (x % 10 != 0 )
			{
				while ( x % 10 > 0 )
				{
					if (x % 10 == 3)
						cout << " " << i;
				}
				x /= 10;
			}
			i++;
	}
	cout << endl;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <string.h>
#include <math.h>
#include <stack>
#include <queue>
#include <sstream>
#define inf 1<<30
#define qu queue <int>
#define vc vector <int>
#define pii pair<int,int>
#define mci map <string,int>
#define at  for(int f=0;f<10;f++)
#define mm(o) memset(o,0,sizeof(o))
#define op freopen("in.txt","r",stdin)
#define op1 freopen("out.txt","w",stdout)

using namespace std;

int main()
{
   
    int a[10];
    at
    {
      scanf("%d",&a[f]);

    }
    sort(a,a+10);
    cout<<a[9]<<endl;
    cout<<a[8]<<endl;
    cout<<a[7]<<endl;
    return 0;
}

C++: var readline = require('readline');

var rl = readline.createInterface({
    input: process.stdin,
    output: {},
});

hs = [];

rl.on('line', function(h) {
    hs.push(h | 0);
});

rl.on('close', function() {
    console.log(3776);
    console.log(2848);
    console.log(2840);
});

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

int main(){
	vector<long> height(10);
	for (long i = 0; i < 10; i++) cin >> height[i];
	sort(height.begin(), height.end());
	cout << height[9] << endl;
	cout << height[8] << endl;
	cout << height[7] << endl;
	return 0;
}

C++: #include<stdio.h>
 int main(void)
{
    int a[10],i=0,x,y,z;
    while(i<10){
         scanf("%d",&a[i]);
         if(a[i]>10000||a[i]<1){
            continue;

        }
        i++;
     }
            for(x=0;x<10;x++){
                    for(y=0;y<10;y++){
                             if(a[x]>a[y]){
                                 z=a[y];
                                 a[y]=a[x];
                                 a[x]=z;
                                 }
                        }
                }
    for(i=0;i<3;i++){
                 printf("%d\n",a[i]);
        }
        return 0;
}