Go: package main

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

var maxint = 10000
var scanner = bufio.NewScanner(os.Stdin)

func nextInt() (int, error) {
	scanner.Scan()
	return strconv.Atoi(scanner.Text())
}

func main() {
	scanner.Split(bufio.ScanWords)
	arr := make([]int, 10)
	for i := range arr {
		n, _ := nextInt()
		arr[i] = n
	}

	sort.Slice(arr, func(i, j int) bool {
		return arr[i] >= arr[j]
	})

	arrStr := fmt.Sprintf("%+v", arr[0:3])
	arrStr = arrStr[1:(len(arrStr) - 1)]
	arrStr = strings.Replace(arrStr, " ", "\n", -1)
	fmt.Println(arrStr)
}

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

int main()
{
	int ta=0;
	int top=0,se=0,sa=0;
	int dumy=0;

	for(int i=0;i<10;i++)
	{
		cin>>ta;
		if(ta>sa)
		{
			sa=ta;
		}
		if(sa>se)
		{
			dumy=se;
			se=sa;
			sa=dumy;
		}
		if(se>top)
		{
			dumy=top;
			top=se;
			se=dumy;
		}
		if(sa>se)
		{
			dumy=se;
			se=sa;
			sa=dumy;
		}
	}
	cout<<top<<endl;
	cout<<se<<endl;
	cout<<sa<<endl;

	return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int mount[10];
	for(int f1=0;f1<10;f1++){
		scanf("%d",&mount[f1]);
	}
	int mem;
	for(int f1=0;f1<10;f1++){
		for(int f2=0;f2<10;f2++){
			if(mount[f1]>mount[f2]){
				mem=mount[f1];
				mount[f1]=mount[f2];
				mount[f2]=mem;
			}
		}
	}
	for(int f1=0;f1<3;f1++){
		printf("%d\n",mount[f1]);
	}
	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<<highendl<<endl;
	cout<<middle<<endl;
	cout<<low<<endl;
return 0;
}

C++: #import<iostream>
#import<deque>
#import<algorithm>
using namespace std;main(){int n,i;deque<int>h;while(cin>>n)h.push_back(n);sort(h.begin(),h.end());for(i=9;i>6;)cout<<h[i--]<<endl;}

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());
  for(int i=0;i<3;i++)
    cout << v[9-i] << endl;
  return 0;
}

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

int main(){
	int num;
	int height[10];
	for(int i=0;i<=9;i++)
		cin>>height[i];

	for(int i=0;i<=9;i++){
		for(int j=i+1;j<=9;j++){
			if(height[i]<=height[j]){
				num=height[i];
				height[i]=height[j];
				height[j]=num;
			}
		}
	}
	for(i=0;i<=2;i++)
		cout<<height[i]<<endl;
	return 0;
}

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

using namespace std;

int main() {

  vector<int> height;
  int h;

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

    cin >> h;

    height.push_back(h);

  }

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

  for(int i=0;i<3;i++) {

    cout << height[9-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;
	}
	return 0;
}

C++: #include<stdio.h>

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

		for(int j = 0; j < 3; j++)
		{
			if(biggest3[j] < input)
			{
				int swap = biggest3[j];
				biggest3[j] = input;
				input = swap;
			}
		}
	}

	printf("%d\n%d\n%d\n", biggest3[0], biggest3[1], biggest3[2]);

	return 0;
}

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

int main()
{
    priority_queue< int,vector<int>,less<int> > que;
    int in;
    
    for(int i = 0; i < 10; i++){
        cin >> in;
        que.push(in);
    }
    
    
    for(int j = 0; j < 3; j++){
        cout << que.top() << '\n';
        que.pop();
    }
    
    return 0;
}

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

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

C++: #include<iostream>
using namespace std;
int main(){
	int takasa[10];
	for(int i=0;i<10;i++){
		cin>>takasa[i];
	}
	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]<<endl;
	}





	return 0;
}

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

int main(){
 int mountain,first=0,second=0,third=0;
 for(int i=0;i<10;i++){
  cin>>mountain;
  if(mountain>first){
   third=second;
   second=first;
   first=mountain;
  }else if(mountain>second){
   third=second;
   second=mountain;
  }else if(mountain>third){
   third=mountain;
  }
 }
 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 = 0; i < 2; i++)
		cout << a[9] << endl;
		cout << a[8] << endl;
		cout << a[7] << endl;

	
	return 0;
}

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

C++: #include <iostream>

int main(){
	int m,mf=0,ms=0,mt=0;
	for(int a=0;a<10;a++){
		std::cin>>m;
		if(m>mf){
			mt=ms;
			ms=mf;
			mf=m;
			m=0;
	    }
		if(m>ms){
			mt=ms;
			ms=m;	
			m=0;
		}
			
		if(m>mt){
			mt=m;
			
		}
			
		
	}
	std::cout<<mf<<std::endl<<ms<<std::endl<<mt;
	return 0;
}

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

using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

int main(int, char**)
{
    vector<int> a(10);
    rep(i,10) cin >> a[i];
    sort(a.begin(), a.end(), greater<int>());
    rep(i,3) cout << a[i] << endl;

    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<math.h>
typedef long long int ll;
using namespace std;

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

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

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

    std::sort(std::begin(heights), std::end(heights), std::greater<int>());

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

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

int main() {
	int height[10];
	int first=0, second=0, third=0;
	int i=0;
	for (;i<10;i++)
		cin>>height[i];
	for (i=0;i<10;i++)
		if (first<height[i])
			first=height[i];
	for (i=0;i<10;i++)
		if (second<height[i]&&first>height[i])
			second=height[i];
	for (i=0;i<10;i++)
		if (third<height[i]&&second>height[i])
			third=height[i];
	cout<<first<<endl<<second<<endl<<third<<endl;
	return 0;
}

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

int main(){

	vector<int> hills(10);

	for (auto& a : hills) {
		cin >> a;
	}

	sort(hills.begin(), hills.end(), greater<int>());

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

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int a = 0, b = 0, c = 0, d = 0;
	for (int i = 0; i < 10; i++){
		cin >> a;
		if (a>b){
			d = c;
			c = b;
			b = a;
		}
		else if (a > c){
			d = c;
			c = a;
		}
		else if (a > d){
			d = a;
		}
	}
	cout << b << endl << c << endl << d;
	return 0;
}

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

void hikaku(){
	int a[10],yoke;
	for(int i=0;i<10;i++){
		cin>>a[i];
		}
	for(int i=0;i<9;i++){
		for(int n=i+1;n<10;n++){
			if(a[i]<a[n]){
				yoke=a[i];
				a[i]=a[n];
				a[n]=yoke;
				}
			}
		}
	for(int i=0;i<3;i++){
		cout<<a[i]<<endl;
		}
}
int main(){
	hikaku();
	return 0;
	}