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>

using namespace std;

int main()
{
   int mountain [10] = {100,400,550,800,150,700,1800,6000,7800,890};
   cout << mountain [8] << endl;
   cout << mountain [7] << endl;
   cout << mountain [6] << endl;


    return 0;
}

C++: #include<cstdio>
#define LOOP(i,f,t) for(int i=f;i<t;++i)
inline void swap(short&a,short&b){
  int t=a;a=b;b=t;
}
int main(){
  short h[10];
  LOOP(i,0,10)scanf("%d",h+i);
  LOOP(i,0,3){
    LOOP(j,i+1,10){
      if(h[i]<h[j])swap(h[i],h[j]);
    }
  }
  LOOP(i,0,3)printf("%d\n",h[i]);
}

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

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

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

int main(){
    int a=0, b=0, c=0, n;
    
    for(int i=0; i<10; i++){
        cin >> n;
        if(n>a){
            c=b; b=a; a=n;
        }else if(n>b){
            c=b; b=n;
        }else if(n>c) c=n;
    }
    cout << a << endl << b << endl << c << endl;
    
    return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>

#define REP(i,n) for(int i=0;i<n;++i)
#define REPR(i,n) for(int i=n;i>=0;--i)
#define REPI(itr,v) for(auto itr=v.begin();itr!=v.end();++itr)
#define REPIR(itr,v) for(auto itr=v.rbegin();itr!=v.rend();++itr)
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define SORT(v,n) sort(v, v+n)
#define SORTV(v) sort(v.begin(), v.end())
#define ALL(v) v.begin(),v.end()
#define llong long long
#define INF 999999999
#define SUR 1000000007
#define pb push_back
#define pf push_front
#define MP make_pair

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

using namespace std;

typedef pair<int,int> pii;

int main(){

  vector<int> v(10);
  REP(i,10){
    scanf("%d", &v[i]);
  }

  sort(ALL(v), greater<int>());
  REP(i,3){
    printf("%d\n", v[i]);
  }
  return 0;
}

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

C++: #include<stdio>
int main(){
printf("aaaaaaaa");
return 0;
}

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

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

  return 0;
}

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

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

C++: #include <stdio.h>
void quickSort(int numbers[], int l, int r);
int main()
{
	int numbers[10];
	for (int i = 0; i < 10; i++) {
		scanf("%d", &numbers[i]);
	}
	quickSort(numbers, 0, 9);
	for (int i = 7; i < 10; i++)
		printf("%d", numbers[i]);
	return 0;
}
void quickSort(int numbers[], int l, int r)
{
	if (l < r)
	{
		int i = l, j = r, x = numbers[l];
		while (i < j)
		{
			while (i < j && numbers[j] >= x)
				j--;
			if (i < j)
				numbers[i++] = numbers[j];

			while (i < j && numbers[i] < x)
				i++;
			if (i < j)
				numbers[j--] = numbers[i];
		}
		numbers[i] = x;
		quickSort(numbers, l, i - 1);
		quickSort(numbers, i + 1, r);
	}
}

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

int main(){

	int mt[10];
	int i;
	
	for(i=0;i<10;i++){
		std::cin >> mt[i];
	}
	
	std::sort(mt,mt+10,std::greater<int>());
	
	for(i=0;i<3;i++){
		std::cout << mt[i] << std::endl;
	}
}

C++: #include <iostream>
 
int main() {
  int heights[16] = { 0 };
  int temp_result = 0;
  int index = 12;
 
  for(int i = 0; i < 10; i++) {
    std::cin >> heights[i];
  }
 
  for(int j = 0; j < 3; j++) {
    heights[index] = 0;
    index = 0;
    temp_result = 0;
    for(int i = 0; i < 10; i++) {
      if(temp_result < heights[i]) {
        temp_result = heights[i];
        index = i;
      }
    }
    std::cout << temp_result << std::endl;
  }
 
 
  return 0;
}

C++: #include<iostream>

int main(void)
{
	int i,j,max,tmp,high[10];

	for(i=0;i<10;i++){
		std::cin >> high[i];
	}

	for(i=0;i<3;i++){
		for(j=1,tmp=0,max=high[0];j<10;j++){
			if(max<high[j]){
				max=high[j];
				tmp=j;
			}
		}
		high[tmp]=0;
		std::cout << max << std::endl;
	}
	return 0;
}

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

C++: #include<stdio.h>
int main(void) {
	int a, b, c[12],top=0,second=0,thread=0;
	for (int i = 1; i <= 10; i++)
	{
		scanf("%d", &c[i]);
		if (c[i]>=top)
		{
			second = top;
			top = c[i];
		}
		else
		{
			if (c[i]>=second)
			{
				thread = second;
				second = c[i];
			}
			else
			{
				if (c[i]>thread)
				{
					thread = c[i];
				}
			}
		}
	}
	printf("%d\n%d\n%d\n", top, second, thread);
	return 0;
}

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

using namespace std;

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