Go: package main

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

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func toInt(str string) int {
	n, _ := strconv.Atoi(str)
	return n
}

func main() {
	lst := make([]int, 0)
	for i := 0; i < 10; i++ {
		lst = append(lst, toInt(readLine()))
	}
	sort.Ints(lst)
	for i := 9; i > 6; i-- {
		fmt.Println(lst[i])
	}
}

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

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int in;
    vector<int> v;
    while(cin >> in)
    {
        v.push_back(in);
    }
    sort(v.begin(), v.end());
    for(auto num : v)
        cout << num << endl;
}

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

int main(){
	cin.tie(0);
   	ios::sync_with_stdio(false);

	int height;
	priority_queue<int> pq;

	for(int i = 0; i < 10; i++){
		cin >> height;
		pq.push(height);
	}

	for(int i = 0; i < 3; i++){
		cout << pq.top() << "\n";
		pq.pop();
	}
}

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

C++: #include <bits/stdc++.h>
using namespace std;
int n,a[50];
int main(){
    n=10;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=n;i>=n-2;i--){
        cout<<a[i]<<endl;
    }
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int t[10];
int main(){
  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;
  
  return 0;
}

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

using namespace std;

int data;
int mountain[10];

int main(){
	for(int i=0;i<10;i++){
		cin >> data;
		mountain[i] = data;
	}

	sort(mountain, mountain + 10);

	for(int j=9;j>6;j--){
		printf("%d\n",mountain[j]);
	}

    return 0;
}

C++: #include <stdio.h>
#include <stdlib.h>
#include <string.h>

void print_top3(int *top3) {
	int i;
	for (i = 0; i < 3; i++) {
		printf("%d\n", top3[i]);
	}
}

int main() {
	char buf[256];
	int top3[3];
	int n, i, trade;
	
	// initialize
	memset(top3, 0, sizeof(int) * 3);
	
	while (fgets(buf, sizeof(buf), stdin)) {
		n = atoi(buf);
		
		if (n <= buf[2]) { break; }
		
		top3[2] = n;
		for (i = 1; 0 <= i; i--) {
			if (top3[i] < top3[i + 1]) {
				trade = top3[i];
				top3[i] = top3[i + 1];
				top3[i + 1] = trade;
			}
		}
	}
	
	print_top3(top3);
	
	return 0;
}

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

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

C++: #include <iostream>
#include <algorithm>
int main() {
  int data[10];
  for (int i = 0; i < 10; i++) {
    std::cin >> data[i];
  }
  std::sort(data,data+10,std::greater<int>());
  for (int i = 0; i < 10; i++) {
    std::cout << data[i] << std::endl;
  }
}

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

int N;

int main(){
	N = 10;
	int t;
	int mh[N];
	
	for(int i=0; i<10; i++){
		cin >> t;
		if(t>=0 && t<=10000)
			mh[i]=t;
		else{
			i=i-1;
		}
	}
	
	for(int i=0; i<10; i++){
		for(int j=i+1; j<10; j++){
			if(mh[i] < mh[j]){
				t = mh[i];
				mh[i] = mh[j];
				mh[j] = t;
			}
		}
	}
	
	for(int i=0; i<3; i++)
		cout << mh[i] << "\n";
	
	return 0;
}

C++: #include<cstdio>

int main(){
    int h[10];
    for(int i=0;i<10;i++)scanf("%d",&h[i]);


    for(int i=0;i<10;i++)
        for(int j=i+1;j<10;j++)
        {
            if(h[i]<h[j])
            {
                int box=h[j];
                h[j]=h[i];
                h[i]=box;
            }
        }


    for(int i=0;i<3;i++)printf("%d\n",h[i]);
    return 0;
}

C++: #include<stdio.h>
int main(void) {
	int i, j,tmp;
	int 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]) {
				tmp = high[i];
				high[i] = high[j];
				high[j] = tmp;
			}
		}
	}
	for (i = 0; i < 3; i++)printf("%d\n", high[i]);
	return 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>());
  for (int i = 0; i < 3; i++) {
    cout << v[i] << endl;
  }
  return 0;
}

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

int a[10];

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

C++: #include <iostream>
using name space std

int main(){
int hight[10];
int Num;
int naka;
int flag;

for(Num=0;Num!=10;Num++)
{
cin>>hight[Num];
};

for(Num=0;flag!=0;flag=0,Num=0)
{
if(hight[Num]<hight[(Num+1)])
{naka=hight[Num];
hight[Num]=hight[(Num+1)];
hight[(Num+1)]=naka;
flag++;&#160;};
};

cin<<hight[0]<<endl;
cin<<hight[1]<<endl;
cin<<hight[2]<<endl;
return 0;
}

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

using namespace std;

int main(void)
{
  int a[10]={};
  int i=0;
  int j=0;

  for(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 <stringstream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstdlib>
using namespace std;

#define REP(i,n) for(int i=0;i<n;++i)
#define rep(n) REP(i,n)

int main()
{
	int hills[10];
	rep(10) cin>>hills[i];

	sort( hills, hills+9, greater<int>() );

	rep(3) cout<<hills[i]<<endl;

	return 0;
}

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

int main(){
  int i1,i2,i3,buff;
  for(int x = 0; x < 10; x++){
    cin >> i3;
    if(i3 > i2){
      buff = i2;
      i2 = i3;
      i3 = buff;
    }
    if(i2 > i1){
      buff = i1;
      i1 = i2;
      i2 = buff;
    }
    
  }
  cout << i1 << endl << i2 << endl << i3 << endl;
  return 0;
}

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

//x[a]で定義される配列を降順に並び替える
void sort_array(int x[],int a){
	int i,j,tmp;
	for(i=0;i<a-1;i++){
		for(j = i+1;j < a ; j++){
			if(x[i] < x[j]){
				tmp = x[i];
				x[i] = x[j];
                x[j] = tmp;
			}
		}
	}
}	

int main(){
	int x[10];
	int i;
	for(i = 0; i< 10; i++)
	{
		cin >> x[i];
	}
	sort_array(x , 10);
	cout << x[0] << endl;
	cout << x[1] << endl;
	cout << x[2] << endl;
	return 0;
}

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

int main(){
	vector<int> h(10);
	for(int i=0;i<=10;i++){
		cin >> h[i];
	}

	sort(h.begin(),h.end());

	for(int i=8;i<11;i++){
		cout << h[i] << endl;
	}

	return 0;
}

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

int main(){

int i,j,h,temp;
int m[10];



//入力
for(i=0; i<10; i++){
   cin >> h;

   if(h >= 0 and h <= 10000){
       m[i]=h;
   }else{
   i--;
   }
}



//ソート
    for (i = 0; i < 9; i++) {
        for (j = 9; j > i; j--) {
            if (m[j - 1] > m[j]) {  
                temp = m[j];  
                m[j] = m[j - 1];
                m[j - 1] = temp;
            }
        }
    }
    
    
//出力
for (i = 9; i > 6; i--) {
   cout << m[i] << "\n";
}

    return 0;
}