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>
#include <algorithm>
#include <functional>

int main()
{
	std::vector<int> vec(10);
	for (int i = 0; i < 10; ++i) {
		std::cin >> vec[i];
	}
	std::partial_sort(
			vec.begin(), vec.begin() + 3, vec.end(),
			std::greater<int>());
	for (int i = 0; i < 3; ++i) {
		std::cout << vec[i] << std::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;
	}
	return 0;
}

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

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

int main(void){
	int mt[10];
	for(int i=0;i<10;i++)
		cin>>mt[i];
	int max_mt[3]={0,};
	for(int j=0;j<3;j++){
		for(int k=0;k<10;k++){
			max_mt[j]=max(max_mt[j],mt[k]);
		}
		cout<<max_mt[j]<<endl;
		for(int ll=0;ll<10;ll++)
			if(max_mt[j]==mt[ll])
				mt[ll]=0;
	}
	return 0;
}

C++: #include <iostream>

int main() {
  int heights[16] = { 0 };
  int temp_result = 0;
  int index = 12;

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

  for(int j = 0; j < 3; j++) {
    heights[index] = 0;
    index = 0;
    temp_result = 0;
    for(int i = 0; i < 10 i++) {
      if(temp_result < heights[i]) {
        temp_result = heights[i];
        index = i;
      }
    }
    std::cout << temp_result << std::endl;
  }


  return 0;
}

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

int main(){
	int i,tmp;
	int tall[3] = {0};
	int num[10];

	for(i = 0 ; i < 10 ; i++){
		cin >> num[i];
		if(tall[0] <= num[i]){
			tmp = tall[2];
			tall[2] = tall[1];
			tall[1] = tall[0];
			tall[0] = num[i];
		}
	}
	for( i = 0; i < 3 ; i++)
		cout << tall[i] << endl;
    return 0;
}

C++: #include <stdio.h>

int main(){
	int talls[10], max, banme;
	for(int i = 0; i < 10; i++) scanf("%d", &talls[i]);
	for(int i = 0; i < 10; i++){
		max = 0;
		for(int j = 0; j < 10; j++){
			if(max < talls[j]){
				max = talls[j];
				banme = j;
			}
		}
		printf("%d\n", max);
		talls[j] = 0;
	}
	return 0;
}

C++: #include <stdio.h>
#include <algorithm>
#include <vector>

#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define REP(i,n) FOR(i,0,n)

int main()
{
  int n;
  std::vector<int> d;
  REP(i,10) {
      scanf("%d", &n);;
      d.push_back(n);
  }
  std::sort(d.begin(), d.end(), std::greater<int>() );
  printf("%d\n",d[0]);
  printf("%d\n",d[1]);
  printf("%d\n",d[2]);
  
  return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	int takasa[10];
	for(int i = 0; i <10; i++){
		cin >> takasa[i];
	}
	//sort
	for(int i = 0; i < 9; i++){
		for (int j = i+1; j < 10; j++){
			if(takasa[i] < takasa[j]){
				swap(takasa[i],takasa[j]);
			}
		}
	}
	for(int i = 0; i < 3; i++){
		cout << takasa[i] << "\n";
	}
	return 0;
}

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

int main()
{
	vector<int> v;
	int n;
	for (int i = 0; i < 10; i++) {
		cin >> n;
		v.push_back(n);
	}
	sort(v.begin(), v.end());

	for (int i = 0; i < 3; i++) {
		cout << v.back() << endl;
		v.pop_back();
	}
	return 0;
}

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

int main(){
    int mt[10], tmp;
    int g = 1;

    for(int i = 0; i < 10; ++i){
        cin >> mt[i]; 
    }
    while(g){
        g = 0;
        for(int i = 1; i < 10; ++i){
            if(mt[i - 1] < mt[i]){
                tmp = mt[i - 1];
                mt[i - 1] = mt[i];
                mt[i] = tmp;
                g = 1;
            }
        }
    }
    
    for(int i = 0; i < 3; ++i){
        cout << mt[i] << " ";
    }
    return 0;
}

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


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

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


int main(void)
{
    int i;
    int num[10];

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

    sort(&num[0], &num[9]);

    printf("%d\n", num[9]);
    printf("%d\n", num[8]);
    printf("%d\n", num[7]);

    return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
	int a[10], min1 = -1, min2 = -1, min3 = -1, i, j, k, l;
	for (i = 0; i < 10; i++) {
		cin >> a[i];
	}
	for (j = 0; j < 10; j++) {
		if (a[j] > min1) {
			min1 = a[j];
		}
	}
	for (k = 0; k < 10; k++) {
		if (a[k] > min2 && a[k] != min1) {
			min2 = a[k];
		}
	}
	for (l = 0; 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 <iostream>
#include <string>
using namespace std;


int main(){
	int a[10];
	int n;
	for (int i = 0; i < 10; i++){
		cin >> a[i];
	}
	for (int i = 0; i < 3; i++){
		for (int j = 0; j < 10; j++){
			if (i < j){
				if (a[i] < a[j]){
					n = a[i];
					a[i] = a[j];
					a[j] = n;
				}
			}
		}
	}
	for (int i = 0; i < 3; i++){
		cout << a[i] << endl;
	}
	return 0;
}

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

int main(){
	int yama[10], i, p, Flag = 0, t;
	for(i = 0; i < 10; i++)
		cin >> yama[i];
	while(1){
		Flag = 0;
		for(i = 0; i < 10; i++){
			if(yama[i] < yama[i + 1]){
				t = yama[i];
				yama[i] = yama[i + 1];
				yama[i + 1] = t;
				Flag++;
			}
		}
		if(Flag != 0)
			break;
	}
	cout << yama[1] << "\n"
	cout << yama[2] << "\n"
	cout << yama[3] << "\n"
	return 0;
}

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

int main(void) {
    std::priority_queue<u_int> heights;
    //??\???
    for (u_int h, i = 0; i < 10; ++i) {
        std::cin >> h;
        heights.push(h);
    }
	//??????
    for (u_int i = 0; i < 3; ++i) {
        std::cout << heights.top() << std::endl;
        heights.pop();
    }
    return 0;
}

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

using namespace std;

int main()
{
	int buf;
	priority_queue<int> qu;

	for ( int i = 0; i < 10; i++ )
	{
		cin >> buf;
		qu.push( buf );
	}
	putchar('\n');

	for ( int i = 0; i < 3; i++ )
	{
		printf("%d\n", qu.top() );
		qu.pop();
	}

	return 0;
}

C++: #include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int main(){
	vi a(10,0);
	fu(0,10){
		cin>>a[i];
	}
	sort(a.rbegin(), a.rend());
	fu(0,3){
		cout<<a[i]<<endl;
	}
}