Go: package main

import (
	"fmt"
	"sort"
)

func main() {
	mt := make([]int, 10)

	for i := 0; i < 10; i++ {
		fmt.Scan(&mt[i])
	}

	sort.Ints(mt)
	fmt.Printf("%d\n%d\n%d\n", mt[9], mt[8], mt[7])

}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
	int h = 0,m = 0,l = 0,tmp,i;

	for(i = 0;i < 10;i++){
		cin>>tmp;
		if(tmp >= h){
			l = m;
			m = h;
			h = tmp;
		}else if(tmp >= m){
			l = m;
			m = tmp;
		}else if(tmp >= l){
			l = tmp;
		}
		cout<<h<<endl;
		cout<<m<<endl;
		cout<<l<<endl;
	}
	cout<<h<<endl;
	cout<<m<<endl;
	cout<<l<<endl;
	return 0;
}

C++: /*
List of Top 3 Hills
?±±???????????????????????????????????´??°??§??¨?????? 10 ?????????????????????????????????
?????? 10 ?????????????????????????????????
???????????§????????????????????????????????????????????°?????????????????????????????????
*/

#include <iostream>
#include <array>

using namespace std;

int main()
{
	// ?????°??£?¨?
	array< int, 10 > array1;

	// ??\?????????
	for ( int i = 0; i < 10; i++ ) {
		cin >> array1[ i ];
	}

	// ???????????????
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 0; j < i; j++ ) {
			if ( array1[ j ] > array1[ i ] ) {
				int tmp = array1[ i ];
				array1[ i ] = array1[ j ];
				array1[ j ] = tmp;
			}
		}
	}

	// ????????????
	cout << array1[ 9 ] << endl << array1[ 8 ] << endl << array1[ 7 ] << endl;

	return 0;
}

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

#define rep(p,q) for(int i = p; i < q;i++)

//1

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

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int hill[10];
  for(int i=0; i<10; i++){
    cin >>hill[i];
  }
  sort(hill,hill+10);
  cout <<hill[9]<<endl<<hill[8]<<endl<<hill[8]<<endl;
  return 0;
}

C++: #include <iostream>
//#include <iomanip>
//#include <vector>
#include <string>
#include <algorithm>
#include <functional>

using namespace std;

int main(){

	int h[10];

	for (int i = 1; i <= 9; i++){
		cin >> h[i];
	}

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

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

	return 0;
}

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

int main()
{
	int nArrIn[10] = { 0 };
	int n = 0;
	while (n < 10)
	{
		cin >> nArrIn[n];
		n++;
	}
	sort(nArrIn, nArrIn + 10);
	cout << nArrIn[9] << endl;
	cout << nArrIn[8] << endl;
	cout << nArrIn[7] << endl;
	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
    long long i,a;
    vector<int>v;
    for(i=0;i<10;i++)
    {
        cin>>a;
        v.push_back(a);
    }
    sort(v.begin(),v.end());
    cout<<v[9]<<endl<<v[8]<<endl<<v[7]<<endl;
    v.clear();
    return 0;
}

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

int main(int argc, char *argv[]) {
  int hills[10] = {0};

  for (int i = 0; i < 10; i++)
    cin >> hills[i];
  sort(hills, hills + 10);
  for (int i = 0; i < 3; i++)
    cout << hills[9-i] << 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];
	}
	for(int x=0;x<10;x++){
		for(int i=0;i<9;i++){
			if(a[i] > a[i+1]){
				swap(a[i],a[i+1]);
			}
		}
		
	}
	cout<<a[9]<<" "<<a[8]<<" "<<a[7]<<endl;
	return 0;
}

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

int main()
{
	std::priority_queue<int> q;
	for( int i = 0; i < 10; i++ ){
		int n;
		std::cin >> n;
		q.push( n );
	}
	
	for( int i = 0; i < 3; i++ ){
		std::cout << q.top() << std::endl;
		q.pop();
	}

 	return 0;
}

C++: #include <iostream>

int main(){
	int Hills[10],i,j,n;

	for(i=0;i<10;i++){
	std::cin>>Hills[i];
		}
	for(i=0;i<9;i++){
		for(j=i+1;j<10;j++){
           if(Hills[i]<Hills[j]){
	         n=Hills[i];
			 Hills[i]=Hills[j];
			 Hills[j]=n;
			   }
			}
		}
	for(i=0;i<3;i++){
		std::cout<<Hills[i]<<std::endl;
		}

	
		return 0;
		}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int a[100],i,j,temp;
    while(1)
    {
        for(i=0;i<10;i++)
        {
            scanf("%d",&a[i]);
        }

        sort(a,a+10);

        for(i=9;i>=7;i--)
        {
            printf("%d\n",a[i]);
        }
    }
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int hight[10], i, j, tmp;
     
    for(i = 0; i < 10; i++) 
        cin >> hight[i];
     
    for(i = 0; i < 10; i++){
        for(j = i + 1; j < 10; j++){
            if(hight[i] >= hight[j]){
                tmp = hight[i];
                hight[i] = hight[j];
                hight[j] = tmp;
            }
        }
    }
     
    for(i = 9; i > 6; i--){
        cout << hight[i] << endl;
    }
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
	int h = 0,m = 0,l = 0,tmp,i;

	for(i = 0;i < 9;i++){
		cin>>tmp;
		if(tmp >= h){
			l = m;
			m = h;
			h = tmp;
		}else if(tmp >= m){
			l = m;
			m = tmp;
		}else if(tmp >= l){
			l = tmp;
		}
	}
	cout<<h<<endl;
	cout<<m<<endl;
	cout<<l<<endl;
	return 0;
}

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

int main(){
	int i=0;
	int m[10];
	for(i=0;i<10;i++)
	{
		cin>>m[i];
		while(0>m[i]||m[i]>10000)
			cin>>m[i];

	}
	
  sort(m[0], m[9], greater<int>());
	
	cout<<m[0]<<endl<<m[1]<<endl<<m[2]<<endl;

    return 0;
}

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

int main()
{
    const int Size = 10;
    std::vector<int> List(Size);
    for(int i = 0; i < Size; ++i){
        std::cin >> List[i];
    }
    std::sort(List.begin(), List.end(), std::greater<int>());
    
    std::cout << List[0] << std::endl;
    std::cout << List[1] << std::endl;
    std::cout << List[2] << std::endl;

    return 0;
}

C++: #include<iostream>
using namespace std;
int main()
{
    int mou[10];
    for(int i=0;i<10;i++)
        cin>>mou[i];
    for(int j=0;j<10;j++)
    {
        int temp=0;
        for(int i=0;i<9-j;i++)
    {
        if(mou[i]>mou[i+1])
            {int temp=mou[i];
            mou[i]=mou[i+1];
            mou[i+1]=temp;
            temp=1;}
    }
    if(temp=0)
        break;
    }
        cout<<mou[9]<<"\n"<<mou[8]<<"\n"<<mou[7]<<endl;
    return 0;
}

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

#define MAX 10

using namespace std;

int main() {

	int list[MAX];

	for (int i = 0; i < MAX; i++) {
		cin >> list[i];
	}

	sort(list, list+MAX);
	for (int i = 0; i < 3; i++) {
		cout << list[MAX-i-1] << endl;
	}

	return 0;
}

C++: #include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;
long long int a[1000];
int main()
{
    //int i,j;

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

    for(int j=9;j>=7;j--)
    printf("%lld\n",a[j]);
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int m1 = -1;
int m2 = -2;
int m3 = -3;
int m;

int main() {
    for (int i=0; i<10; i++) {
        cin >> m;
        if(m1 < m) {
            m3 = m2;
            m2 = m1;
            m1 = m;
        }
        else if(m2 < m) {
            m3 = m2;
            m2 = m;
        }
        else if(m3 < m) m3 = m;
    }
    cout << m1 << "\n" << m2 << "\n" << m3 << endl;

}

C++: #include<cstdio>

int main(){
  int data[10],order[10];

  //入力＆初期化
  for(int i=0;i<10;i++){
    scanf("%d",&data[i]);
    order[i]=1;
  }

  //順位付け
  for(int i=1;i<10;i++)
    for(int j=0;j<i;j++){
      if(data[j]<data[i]) order[j]++;
      if(data[j]>=data[i]) order[i]++;
    }

  //表示
  for(int i=1;i<=3;i++)
    for(int j=0;j<10;j++)
      if(order[j]==i)
	printf("%d\n",data[j]);
   
  return 0;
}