Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

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

using namespace std;

int main()
{
	vector<int> arr(10);
	
	for(int i = 0; i < 10; i++){
		cin >> arr[i];
	}
	
	sort(arr.begin(),arr.end());
	
	printf("%d\n%d\n%d\n",arr[9],arr[8],arr[7]);
	
	return 0;
}

C++: #include <iostream>

using namespace std;

int main(void){
	int val[10];

	for(int i=0;i<10;i++)
		cin >> val[i];

	for(int i=0;i<9;i++)
		for(int j=0;j<9;j++)
			if(val[j]<val[j+1]){
				int tmp=val[j];
				val[j]=val[j+1];
				val[j+1]=tmp;
			}

	for(int i=0;i<3;i++)
		cout << val[i] << endl;

	return 0;
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;
int main(){
	const int N=10;
	int height[N];
	for(int i=0;i<10;i++){
		scanf("%d",height[i]);
	}
	sort(height,height+N);
	reverse(height,height+N);
	for(int j=0;j<3;j++){
		printf("%d",height[j]);
	}
	return 0;
}

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

int main() {

  typedef std::multiset<int> MySet;
  MySet heightSet;

  for(int i = 0; i < 10; ++i)
  {
    int val;
    cin >> val;
    // set ???????´?????????\????????¨??????????????????????????????
    heightSet.insert(val);
  }

  // ??§??????????????¢???????????????????????? reverse_iterator ?????????
  MySet::reverse_iterator rit = heightSet.rbegin();
  for(int i = 0; i < 3; ++i)
  {
    cout << *rit << endl;
    ++rit;
  }
  return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  while (true) {}
}

C++: #include <stdio.h>
int main(){
	int high[10];
	int i,j;
	int max = 0;
	
	for(i = 0;i < 10;i++){
		scanf("%d",&high[i]);
	}
	
	for(i = 0;i < 3;i++){
		for(j = 0;j < 10;j++){
			if(high[max] < high[j]){
				max = j;
			}
		}
		printf("%d\n",high[max]);
		high[max] = 0;
		max = 0;
	}
	return 0;
}

C++: #include<stdio.h>
int main() {
	int a=0, b=0, c=0, i;
	while (scanf("%d", &i) == 1) {
		if (a < i) {
			if (a != 0) {	
				if (0 != b)
					c = b;
				b = a;
			}
			a = i;
		}
		else if (b < i) {
			if (b != 0) 
				c = b;
			b = i;
		}
		else if (c < i)
			c = i;
	}
	printf("%d\n%d\n%d\n", a, b, c);
	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main()
{
    int m[10];

    for (int i = 0; i < 10; ++i) cin >> m[i];

    sort(m, m + 10, greater<int>());

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

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

using namespace::std;

int main() {
    int array[10];

    for(int i=0;i<10;i++)
        cin >> array[i];

    sort(array,array+10);

    cout << array[9] << endl << array[8] << endl << array[7] << endl;
    return 0;
}

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

int main(){
	int mountain[10]={}, first=0, second=0, third=0;

	for(int i=0; i<10; i++){
		cin >> mountain[i];
		if(first < mountain[i]){
			first = mountain[i];	
		}
		else if(mountain[i]<first && mountain[i]>second){
			second = mountain[i];
		}
		else if(mountain[i]<second && mountain[i]>third){
			third = mountain[i];
		}
	}
	cout << first << "\n" << second << "\n" << third << endl;

	return 0;
}

C++: #include<stdio.h>
int main(void){
    int d,m1=0,m2=0,m3=0,i;
    for(i=0;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\n",m1);
    printf("%d\n",m2);
    printf("%d\n",m3);
    return 0;
}

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

using namespace::std;

int main() {
    int array[10];

    for(int i=0;i<10;i++)
      cin >> array[i];

    sort(array,array+10);

    for(int i=9;i>6;i++)
      cout << array[i] << endl;
    return 0;
}

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

using namespace std;

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

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

int 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>
using namespace std;

int main() {
	int first = 0;
	int second = 0;
	int third = 0;

	for (int i = 0; i < 10; i++) {
		int num;

		cin >> num;

		if (first <= num) {
			third = second;
			second = first;
			first = num;
		}
		else if ((second <= num) && (num < first)) {
			third = second;
			second = num;
		}
		else if ((third <= num) && (num < second)) {
			third = num;
		}
		else {
			//???????????????
		}
	}
	cout << first << endl;
	cout << second << endl;
	cout << third << 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++: #include <iostream>
#include <queue>
#include <algorithm>
 
int main(void) {
    std::priority_queue<int> height;
 
    for (int i = 0; i < 10; ++i) {
        int h;
        std::cin >> h;
        height.push(h);
    }
 
    for (int i = 0; i < 3; ++i) {
        std::cout << height.top() << std::endl;
        height.pop();
    }
 
    return 0;
}

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

C++: #include<cstdio>
#include<iostream>
using namespace std;
int a[11];
int main()
{
	int i,max1=-1,max2=-1,max3=-1;
	for(i=1;i<=10;i++)
	{
		cin>>a[i];
		if(a[i]>max1){max3=max2;max2=max1;max1=a[i];}
		else if(a[i]>max2){max3=max2;max2=a[i];}
		else if(a[i]>max3)max3=a[i];
	}
	cout<<max1<<endl<<max2<<endl<<max3;
	return 0;
}