Go: package main

import(
	"fmt"
	"sort"
)

func main() {
	var a int
	var i int
	dataint := [10]int{}
	i = 0
	for _, err := fmt.Scan(&a); err == nil; _, err = fmt.Scan(&a) {
		dataint[i] = a
		i++
	}
	sort.Ints(dataint[:])
	for i:=9; i>6; i--{
		fmt.Println(dataint[i])
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define R__64 18446744073709551616//2^64
#define R__InFinity 100000000;
#define R__PI acos(-1.0)
template <class R> string R__MonthName(R name){string mon[15];mon[1]="January";mon[2]="February";mon[3]="March";mon[4]="April";mon[5]="May";mon[6]="June";mon[7]="July";mon[8]="August";mon[9]="September";mon[10]="October";mon[11]="November";mon[12]="December";return mon[name];}
template <class R> R R__MonthDay(R num){R month[13];month[1]=31;month[2]=28;month[3]=31;month[4]=30;month[5]=31;month[6]=30;month[7]=31;month[8]=31;month[9]=30;month[10]=31;month[11]=30;month[12]=31;return month[num];}
template <class R> R R__GCD(R a,R b){if(b==0) return a;else return R__GCD(b,a%b);}
template <class R> R R__LCM(R a,R b){return (a*b)/R__GCD(a,b);}
template <class R> R R__POW( R a, R b){if(b==0) return 1; R x=a;for(R i=2;i<=b;i++) a=a*x;return a;}
template <class R> R R__BigMod(R a,R b,R c){if(a==0) return 0;if(b==0) return 1;if(b%2==0){R x=R__BigMod(a,b/2,c)%c;return (x*x)%c;}else return  ((a%c)*R__BigMod(a,b-1,c)%c)%c;}
template <class R> R R__Factorial(R a){R b=1;for(R i=1;i<=a;i++)b=b*i;return b;}
template <class R> R R__BinarySearch(R a[],R l,R h,R n){while(l<=h){R m=(l+h)/2;if(n<a[m])h=m-1;else if(n>a[m])l=m+1;else return m;} return -1;}

long long a[100],i;

int main()
{
    //time_t t1=clock();
    //freopen("input.txt","r",stdin);//freopen("output.txt","w",stdout);
    while(cin>>a[0])
    {
        for(i=1;i<=9;i++)
            cin>>a[i];
        sort(&a[0],&a[10]);
        cout<<a[9]<<"\n"<<a[8]<<"\n"<<a[7]<<"\n";
    }
    //time_t t2=clock();
    //cout<<(t2-t1);
    return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream> 
#include <string>
#include <map>
#include <math.h>
#include <vector>
#include <algorithm>
using namespace std; 
int main(){
	vector<int> v;
	for(int i=1;i<=10;i++){
		int h;
		cin >> h;
		v.push_back(h);
	}
	std::sort(v.begin(), v.end());
	std::reverse(v.begin(), v.end());
	for(int i=0;i<3;i++){
		cout << v[i] << endl;
	}
	return 0;
}

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

int main()
{
	int n[10],i=0;

	while (cin >> n[i])
		i++;
	sort(n,n+i-1,greater<int>());
	for (int j=0; j < 3; j++) {
		cout << n[j] << endl;
	}
	return 0;
}

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

using namespace std;

int main()
{
    int i, j, temp;
    int number[15];

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

    for (i=0; i<5; i++)
    {
        for (j=i+1; j<5; j++)
        {
            if (number[i] < number[j])
            {
                temp = number[i];
                number[i] = number[j];
                number[j] = temp;
            }
        }
    }

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

    return 0;
}

C++: #include <iostream>
#include <algorithm>
int main(){
	int arr[10];
	for(int i=0;i<10;i++) std::cin>>arr[i];
	std::sort(arr,arr+10);
	for(int i=9;i>6;i--) std::cout<<arr[i]<<"\n";
	return 0;
}

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


int main(void){

	int a[11],i,max1,max2,max3;

	for (int i=1; i<11; i++){
		while (true){ 
		cout << "山の高さ" << i << "（整数）" ;			
		cin >> a[i];
		if ((cin.good() == 1) && (a[i] >= 0) && (a[i] <= 10000)) {
			break;
		}
		}	
	}


	max1 = 0;
	max2 = 0;
	max3 = 0;

	for (i=1; i<11; ++i){
		if (a[max1] < a[i]){max1 = i;}
	}
		for (i=1;i<11;++i){
			if (a[i] < a[max1]){
				if (a[max2] < a[i]){max2 = i;}
		}
		}
			for (i=1;i<11;++i){
			if (a[i] < a[max2]){
				if (a[max3] < a[i]){max3 = i;}
		}
			}

		cout << a[max1] << endl;
		cout << a[max2] << endl;
		cout << a[max3] << endl;
		

		return 0;
	}

C++: #include <iostream>
using namespace std;
int max(int x[], 10)
{
	int i,j;
	j=0;
	for(i=1; i<n; i++)
		if(x[i]<x[j]) j=i;
		return j;
}
void sel_sort(int x[], 10)
{
	int i, j;
	for(i=10; i>1; i--)
		{ j=max(x,i);   int temp=x[j];   x[j]=x[i-1];  x[i-1]=temp; }
	}
void main()
{
	int a[10], i;
	while(cin>>a[0])
	{
	for(i=1; i<10; i++)
		cin>>a[i];
	sel_sort(a, 10);
	for(i=0; i<3; i++)
		cout<<a[i]<<endl;
	}
	
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
  vector<int> v;
  for (int i = 0; i < 10; i++) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(), v.end(), greater<int>());
  for (int i = 0; i < 3; i++)
    cout << v.at(i) << 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;

		if(first <= num){
			third = second;
			second = first;
			first = num;
		}else if((second <= num) && (num < first) ){
			thid = 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 <bits/stdc++.h>

using namespace std;

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

  int heights[10];
  for (int i = 0; i < 10; i ++) {
    cin >> heights[i];
  }
  sort(begin(heights), end(heights), greater<>());
  for (int i = 0; i < 3; i ++) {
    cout << heights[i] << endl;
  }
}

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


using namespace std;

int main()
{
int a[10];
int k;
for(int i=0;i<10;i++)
{
    cin>>a[i];
    //a.push_back(k);

}
sort(a,a+10);
for(int j=9;j>=7;j--)
    cout<<a[j]<<endl;
    return 0;
}

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

int main()
{
    int a[10];
    for(int i=0;i<10;i++)
        cin>>a[i];
    sort(a,a+10);
    for(int j=0;j<3;j++){
        cout<<a[9-j];
    }
    cout<<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>
using namespace std;
int main(){
int a[10];
for(int i=0;i<10;i++)
cin>>a[i];
for(int i=0;i<10;i++)
		for(int j=i+1;j<10;j++)
			if(a[i]<a[j]){
				int temp=a[i];
				a[i]=a[j];
				a[j]=temp;
			}
	for(int i=0;i<3;i++)
		cout<<a[i]<<endl;
	return 0;
}

C++: #include <algorithm>
#include <iostream>
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 <cstdio>
#include <algorithm>

using namespace std;

int tall[5000];
int idx=0;

int main(){
while(~scanf("%d",tall+idx)){
idx++;
}

sort(tall,tall+idx,greater<int>());

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

}

C++: #include<iostream>

using namespace std;
int main() {
	int i, a, b, c;
	a = 0;
	b = 0;
	c = 0;
	while (cin >> i) {
		if (a < i) {
			c = b;
			b = a;
			a = i;
		}
		else if (b < i) {
			c = b;
			b = i;
		}
		else if (c < i) {
			c = i;
		}
	}
	cout << a << endl << b << endl << c << endl;
	return 0;
}

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

using namespace std;

int main()
{
	vector<int> high(10);
	int i;
	
	for(i = 0; i < 10; i++){
		scanf("%d",&high[i]);
	}
	
	sort(high.begin(), high.end());
	
	cout << high[9] << endl;
	cout << high[8] << endl;
	cout << high[7] << endl;
	
}

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

int main(){
        int i;
        char high[10];
        for(i = 0; i < 10; i++){
                scanf("%d", &high[i]);
        }
        sort(high, high + 10);
        reverse(high, high + 10);
        for(i = 0; i < 3; i++){
                printf("%d", high[i]);
        }
        return 0;
}