Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

func next() string{
	sc.Scan()
	return sc.Text()
}

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

C++: #include <cstdio>
int main(){
    int input;
    int i;
    //scanf("%d",&input);
    int first=0,second=0,third=0;
    for(i=0;i<10;++i){
        scanf("%d",&input);
        if(input>first){
            third=second;
            second=first;
            first=input;
        }
        else if(input>second){
            third=second;
            second=input;
        }
        else if(input>third){
            third=input;
        }
    }
    printf("%d\n%d\n%d\n",first,second,third);
    return 0;
}

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

}

C++: #include<stdio.h>
int main(void) {
	int i, mountain[10],x,y;
	int n = 0;
	int l = 0;
	int m = 0;
	for (i = 0;i < 10;i++) {
		scanf("%d", &mountain[i]);
	}
	for (i = 0;i < 10;i++) {
		if (mountain[i] > m) m = mountain[i];
		x = i;
	}
	printf("%d\n", m);
	for (i = 0;i < 10;i++) {
		if (i == x) {}
			else {if (mountain[i] > n) n = mountain[i];
			y = i;
		}
	}
	printf("%d\n", n);
	for (i = 0;i < 10; i++) {
		if (i == y || i == x) {}
		else	if (mountain[i] > l) l = mountain[i];
		
	}
	printf("%d\n", l);

	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<stdio.h>
#include<algorithm>
using namespace std;
long long int nums[10];
void input()
{
	int i;
	for (i = 0; i < 10; i++)
		scanf("%lld", &nums[i]);
	sort(nums,nums+10);
	printf("%lld\n%lld\n%lld\n", nums[9], nums[8], nums[7]);
}
int main()
{
	input();
	return 0;
}

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

int main(){
  int num = 10;
  int height[num];

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

  int top3[3]={0,0,0};
  for(int i=0; i<num; i++) {
    for(int j=0; j<3; j++) {
      if(height[i] > top3[j]) {
        for(int k=2; k>j; k--)
          top3[k] = top3[k-1];
        top3[j] = height[i];
        break;
      }
    }
  }

  for(int i=0; i<3; i++)
    cout << top3[i] << endl;

  return 0;
}

C++: #include<iostream>

using namespace std;

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

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

int compare_int(const void *a, const void *b)
{
    return *(int*)b - *(int*)a;
}


int main() {
	int a[10];
	
	for(int i = 0;i < 10;i++)
		cin >> a[i];
	
	qsort(a,10,sizeof(int),compare_int);
	
	for(int i = 0;i < 3;i++){
		cout << a[i];
		cout << "\n";
	}
	
	// your code goes here
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){

	int a[10];
	for(int i=0;i<10;i++){
		cin>>a[i];
	}
	sort(a,a+10,greater<int>());
	cout<<a[0]<<endl<<a[1]<<endl<<a[2]<<endl;

return 0;
}

C++: #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
// Whenever you start to believe  yourself, people also start to believe in you
using namespace std;
int cmpfunc (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}
int main()
{
    int n=10;
   int ara[n];
   int i,j,k;
   for(i=0;i<n;i++)
   {
       cin>>ara[i];
   }
   qsort(ara,n, sizeof(int), cmpfunc);
   cout<<ara[n-1]<<endl;
   cout<<ara[n-2]<<endl;
   cout<<ara[n-3]<<endl;
    return 0;
}

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

int main() {

  typedef std::multiset<int> MySet;
  MySet heightSet;

  for(int i = 0; i < 10; ++i)
  {
    int val;
    cin >> val;
    // set ???????´?????????\????????¨??????????????????????????????
    heightSet.insert(val);
  }

  // ??§??????????????¢???????????????????????? reverse_iterator ?????????
  MySet::reverse_iterator rit = heightSet.rbegin();
  for(int i = 0; i < 3; ++i)
  {
    cout << *rit << endl;
    ++rit;
  }
  return 0;
}

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

using namespace std;

int main(){

  vector<int> mountain;
  int height;

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

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

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

C++: #include <bits/stdc++.h>
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<stdio.h>
int main(void)
{
	int a, b, max, max2, max3;
	for (a = 1; a <= 10; a++) {
		scanf("%d",&b);
		if (b > max) {
			max = b;
		}
		else if (b > max2) {
			max2 = b;
		}
		else if (b > max3) {
			b = max3;
		}
		printf("%d\n %d\n %d\n ", max, max2, max3);
		return 0;
	}
}

C++: #include<stdio.h>
int main(void)
{
	int i,j,n,temp;
	int data[10];
	n = 1;
	for(i=0; i<10; i++){
		n++;
		scanf("%d",&data[i]);
	}

	for(i=0; i<9; i++){
		for(j=i+1; j<10; j++){
			if(data[i] > data[j]){
				temp=data[i];
				data[i]=data[j];
				data[j]=temp;
			}
		}

	}

		printf("%d\n",data[9]);
		printf("%d\n",data[8]);
		printf("%d\n",data[7]);
	return 0;
}

C++: #include<stdio.h>

int main(void){

    /* 宣言と初期化 */
    int hai[10];
    int i;
    int temp2nd;
    int temp3rd
    int tempmax;

for(i=0;i<10;i++)
{
printf("山の高さ　");
scanf("%d",hai[i]);
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0]

    /* 計算 */
    for(i=0;i<=10;i++){
        /* 最大値求める */
        if(hai[i]>tempmax)
        tempmax=hai[i];
    }

    for(i=0;i<=10;i++){
        /*2番目求める */
        if(hai[i]<tempmax&&hai[i]>temp2nd)
        temp2nd=hai[i];
    }

    for(i=0;i<=10;i++){
        /* 3番目求める */
        if(hai[i]>temp3rd&&hai[i]<temp2nd)
        temp3rd=hai[i];
    }

    /* 表示 */
    printf("最も高い山の高さ　%d\n",tempmax);
    printf("２番目に高い山の高さ　%d\n",temp2nd);
    printf("３番目に高い山の高さ　%d\n",temp3rd);

    return 0;
}

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

#define MAX 1000000
#define INF 200000000
#define MOD 1000000007

typedef long long ll;
typedef unsigned long long llu;

using namespace std;

int dx[]={-1,0,1,0};
int dy[]={0,-1,0,1};

void IO()
{
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
}

int arr[15];

bool cmp(int a, int b)
{
    return a>b;
}

int main()
{
    //IO();
    for(int i=0;i<10;i++)scanf("%d",&arr[i]);
    sort(arr,arr+10,cmp);
    for(int i=0;i<3;i++)printf("%d\n",arr[i]);
    return 0;
}

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

using namespace std;

int main()
{
	int i;
	int a;
	vector<int> num;
	
	for(i=0;i<10;i++)
	{
		cin >> a ;
		num.push_back(a);
	}
	
	sort(num.begin(),num.end(),greater<int>());
	
	for(i=0;i<3;i++)
		cout << num[i] << endl;
}

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

int i,j,a[12];

int comp(const void *p,const void *q){
	return *(int *)q-*(int *)p;
}

int main(){
	//scanf("%d",&a[0]);
	for(i=0;i<10;i++)scanf("%d\n",&a[i]);
	
	qsort(a,10,sizeof(int),comp);
	
	printf("%d\n",a[0]);
	printf("%d\n",a[1]);
	printf("%d",a[2]);
	
	return 0;
}