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 <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;
}

C++: #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#define N 10
int main(int argc, const char * argv[])
{
    int x=0;
    int max1=-1;
    int max2=-2;
    int max3=-3;
    
    for(int j=0; j<N; j++){
        scanf("%d\n",&x);
        if(max1<=x){
            max3=max2;
            max2=max1;
            max1=x;
        }else if(max2<=x){
            max3=max2;
            max2=x;
        }else if(max3<=x){
            max3=x;
        }
        printf("%d\n",max1);
        printf("%d\n",max2);
        printf("%d\n",max3);

    }
}

C++: #include<iostream>
using namespace std;
int main()
{
    int n,a[100],i,j,temp;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>a[i];

    }
    cout<<"\n"<<endl;
    for(i=0;i<n;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(a[i]<a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    for(i=0;i<3;i++)
    {
        cout<<a[i]<<endl;
    }

   return 0;
}

C++: #include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
    int arr[10];
    int i,j;
    for(i=0;i<10;i++)
    {
        scanf("%d",&arr[i]);
    }
    sort(arr,arr+10);
    for(i=9;i>=7;i--)
    {

        printf("%d\n",arr[i]);
    }

    return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
int main(void){
std::vector<int> h;
int tmp;
while(std::cin>>tmp){
h.push_back(tmp);
}

auto p=std::unique(h.begin(),h.end());
std::sort(h.begin(),p);
for(int i=0;i<3;i++){
std::cout<<h[i]<<std::endl;
}
return 0;
}

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


int main()
{
	int m[100],temp[100];
	for(int i=0;i<10;i++)
	{
		scanf("%d",&m[i]);
	}
	for(int i=0;i<10;i++)
	{
		if(m[i]<m[i+1])
		{
			temp[i]=m[i+1];
			m[i+1]=m[i];
			m[i]=temp[i];
			i=-1;
		}
		
	}
	printf("%d\n%d\n%d\n",m[0],m[1],m[2]);
	return 0;
}

C++: #include<bits/stdc++.stdc>
using namespace std;
int main(){
int a[10];
for(int i =0; i < 10; i++){
cin >> a[i];
}
sort( a, a + 10, greater<int>());
for(int j = 0; j < 3; j++){
cout << a[j] << endl;
}
return 0;
}

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

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

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

int main(){

	list<int> height;
	int h;

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

	height.sort();

	list<int>::iterator it=height.begin();

	for(int i=0;i<3;++i){
		cout<<*it;
		++it;
	}

    return 0;
}

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

int main(){
	int h[10]={};
	

	for(short int i=1; i<=10;i++){
		cin >> h[i];
	}
	sort(h, h+10, greater<int>());
	for(short int i=0;i<3;i++){
		cout << h[i] << endl;
	}
	return 0;
}

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

int main()
{
	int iHigh[10];

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

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

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

	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;

}