Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; i++ {
		sc.Scan()
		heights[i], _ = strconv.Atoi(sc.Text())
	}

	sort.Sort(sort.Reverse(sort.IntSlice(heights)))
	for i := 0; i < 3; i++ {
		fmt.Println(heights[i])
	}
}

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

using namespace std;

int main(){

	int h[10];

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

	sort(h,h+10);

	for (int i = 9; i > 6; i--){
		cout << h[i] << endl;
	}

	return 0;
}

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

int main(){
    int i, t, j;
    int max[3] = {0};
    int mountain[10] = {0};
    
    for(i = 1; i <= 3; i++){
        for(t = 1; t <= 10; t++){
        cin >> mountain[t];
        if(max[i] < mountain[t]) {
            max[i] = mountain[t];
            }
        }
        
        for(j = 1; j <= 10; j++){
            if(max[i] == mountain[j]) mountain[j] = {0};
        }
        
        cout << max[i] << endl;
    }
    
    
    
    
    

    
    return 0;
    
}

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

#define pout(n)  printf ("%d\n", n)

#define rep(i,a,n) for (int i = a;i < n;i++)
#define per(i,n,a) for (int i = n-1;i >= a;i--)

const int d4x[4] = {1, 0, -1, 0};
const int d4y[4] = {0, 1, 0, -1};
const int d8x[8] = { 1,1,0,-1,-1,-1,0,1 };
const int d8y[8] = { 0,1,1,1,0,-1,-1,-1 };
 
typedef long long ll;
using namespace std;
 
int main() {
  int mo[10];
  rep(i,0,10){
    cin >> mo[i];
  }
  sort(mo,mo+10);
  per(i,10,7){
    pout(mo[i]);
  }
  return 0;
}

C++: #include<stdio.h>
int main(void)
{
	int a, b, max, max2, max3;
	max = 0;
	max2 = 0;
	max3 = 0;
	for (a = 1; a <= 10; a++) {
		scanf("%d", &b);
		if (b <= 10000) {
			if (b > max) {
				max2 = max;
				max = b;
			}
			else if (b > max2) {
				max3 = max2;
				max2 = b;

			}
			else if (b > max3) {
				max3 = b;
			}
		}
	}
	printf("%d\n", max);
	printf("%d\n", max2);
	printf("%d\n", max3);
	return 0;
}

C++: #include<stdio.h>


int main()
{
    int a[1000], i , j , k,n, rem;
    //scanf("%d", &n);
    for(i=0; i<10; i++)
    {
        scanf("%d", &a[i]);
    }
 for(i=0; i<10; i++)
    {for(j=0; j<10; j++)
      {

       if(a[j]<a[j+1])
        {
        rem=a[j+1];
        a[j+1]=a[j];
        a[j]=rem;
        }
      }
    }


printf("\n ");
    for(i=1; i<4; i++)
    {
        printf("%d\n", a[i]);
    }
    return 0;
}

C++: #include<stdio.h>

int main()

{
    int i,num,n,count;
    scanf("%d",&n);

      for(i=1;i<=n;i++)

    {
        int num;
        scanf("%d",&num);
        count=0;
        while(num!=0){

            if(num%2==1)
                count++;
                num/=2;
        }
        if(count%2==1)
            printf("Case %d: odd\n",i);
        else
            printf("Case %d: even\n",i);


    }
    return 0;
}

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

C++: #include <iostream>
#include <algorithm>
#include <deque>
#include <functional>
using namespace std;
int main(){
	int num;
	deque<int> h;
	for(int i = 0; i < 10; i++){
		cin >> num;
		h.push_back(num);
	}
	sort(h.begin(), h.end(), greater<int>());
	deque<int>::iterator it = h.begin();
	while(it != h.begin()+3){
		cout << *it << endl;
		++it;
	}
	return(0);
}

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

#include<vector>
#include<algorithm>

using namespace std;
int main()
{
	vector<int> vec;
	int temp;
	for (int i = 0; i < 10; i++)
	{
		cin >> temp;
		vec.push_back(temp);
	}
	make_heap(vec.begin(), vec.end());
	for (int i = 0; i < 3; i ++ )
	{
		cout << vec.front()<<endl;
		pop_heap(vec.begin(), vec.end());
		vec.pop_back();
	}
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
#include <math.h>
#include <string>
#include <string.h>
#include <stack>
#include <algorithm>
#include <stdio.h>
#include <functional>
using namespace std;

//??°?????????????????°

void function()
{
    //??¢??°
}
 
int main(){
    int max1 = 0;
    int max2 = 0;
    int max3 = 0;
    for (int i = 0; i < 9; i++){
    	int a;
		cin >> a;
		if(a > max1){
		max3 = max2;
		max2 = max1;
		max1 = a;
		}else if(a > max2){
			max3 = max2;
			max2 = a;
		}else if(a > max3){
			max3 = a;
		}
    }
    cout << max1 << endl << max2 << endl << max3 << endl;
    return 0;
}

C++: #include<iostream>
  using namespace std;
   int main(){
      int a[10];
      int temp;
      for(int m=0; m<10; m++)
      {
          cin >> a[m];
      }
    temp=a[0];
      for(int i=0; i<10; i++)
      {
          for(int j=0; j<10;j++)
          {
          if(a[i] > a[j])
          {
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
          }
        }
      }
      for(int k=0; k<3; k++)
      {
          cout << a[k]<< endl;
      }
   }

C++: #include <functional>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <climits>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <deque>
#include <list>
#include <map>
#include <set>
using namespace std;

typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ULL;

typedef pair < int , int > ii;
typedef pair < LL  , LL  > ll;

typedef vector <int>  vint;
typedef vector <bool> vbool;
typedef vector <long> vlong;

#define sz(x)			((int)x.size())
#define tin(x)			scanf("%d",&x)
#define all(x)			x.begin(),x.end()
#define Set(b,a)		memset(b,a,sizeof b)
#define print1(x)		printf("Case %d:",x++)
#define tin2(x,y)		scanf("%d%d",&x,&y)
#define tin3(x,y,z)		scanf("%d%d%d",&x,&y,&z)
#define loop(i,i0,in)	for(int i=i0 ; i<in ; i++)
#define rep(i,n)		for(int i=0 ; i<(n) ; i++)
#define _rep(i,n)		for(int i=n-1 ; i>=0 ; i--)
#define _loop(i,in,i0)	for(int i=in-1 ; i>=i0 ; i--)
#define Fore(it, x)		for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)

const int maxn = 10+5;

int seq[maxn];
     
int main()  
{  
#ifdef Online_Judge
	freopen("a.in","r",stdin);
#endif
	rep(i,10)
		tin(seq[i]);
	sort(seq,seq+10);
	_loop(i,10,7)
		printf("%d\n",seq[i]);
	return 0;
}

C++: #include <stdio.h>
main(){
  int h[10];
  int st,nd,rd,i;
  st = 0;
  nd = 0;
  rd = 0;
  for(i=0;i<10;i++){
    scanf("%d",&h[i]);
    if(h[i]>st){
      st = h[i];
    }else if(h[i]>nd){
      nd = h[i];
    }else if(h[i]>rd){
      rd = h[i];
    }
  }
  printf("%d\n%d\n%d\n",st,nd,rd);
}

C++: #include <stdio.h>
int main()
{
	int a[10];
	int i,j,k;
	for (i=0;i<10;i++)
			scanf("%d",&a[i]);
		for (i=0;i<9;i++)
		{
			for(j=i+1;j<10;j++)
			{
				if(a[j]>a[i])
				{
					k=a[i];
					a[i]=a[j];
					a[j]=k;
				}
			}
			if(i==2)
				printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
		}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
	int a[10],k=0,tmp,i;
	for(i=0;i<10;i++)
		cin>>a[i];
	while(1){//無限ループ
		for(i=0;i<10;i++){
			if(a[i]<a[i+1]){//もし昇順でない場合
				tmp=a[i];//隣接しあう値を昇順に入れ替える
				a[i]=a[i+1];
				a[i+1]=tmp;
				k++;//カウント
			}
		}
		if(k==0) break;//入れ替える必要がなくなったら終了
		k=0;//カウントの初期化
	}
	for(i=0;i<3;i++)
		cout<<a[i]<<endl;
	return 0;
}

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

using namespace std;

int main() {
	vector<int> heights;
	int meter;

	for(int index = 0; index < 10; ++index) {
		cin >> meter;
		heights.push_back(meter);
	}
	
	reverse(heights.begin(), heights.end());
	
	cout << heights[0] << endl;
	cout << heights[1] << endl;
	cout << heights[2] << endl;
	
	return 0;
}