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<vector>
#include<algorithm>
using namespace std;
int main(){
  int x;
  vector<int>a;
  for(int i=0;i<10;i++){
    cin>>x;
    a.push_back(x);
  }
  sort(a.begin(),a.end()); 
  cout<<a[9]<<endl;
  cout<<a[8]<<endl;
  cout<<a[7]<<endl;
}

C++: #include <iostream>

auto main () -> int
{
    constexpr auto n = 10;
    int highest [3] = {};
    
    for (int i = 0; i < n; ++ i)
    {
        int h;
        std::cin >> h;
        if (highest [0] < h)
        {
            highest [2] = highest [1];
            highest [1] = highest [0];
            highest [0] = h;
        }
        else if (highest [1] < h)
        {
            highest [2] = highest [1];
            highest [1] = h;
        }
        else if (highest [2] < h)
        {
            highest [2] = h;
        }
    }

    for (auto && elem : highest)
    {
        std::cout << elem << std::endl;
    }
}

C++: #include <functional>
#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,greater<int>());
	for (int i = 0; i < 3; i++)
	{
		cout << a[i] << endl;
	}
	return 0;
}

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

int main(){
  vector<int>height(10);
  for(int i=0;i<10;i++){
    cin >> height.at(i);
  }
  for(int j=0;j<10;j++){
    for(int i=0;i<9;i++){
      if(height.at(i)>height.at(i+1)){
        swap(height.at(i),height.at(i+1));
      }
    }
  }
cout <<height.at(9)<<endl;
cout <<height.at(8)<<endl;
cout <<height.at(7)<<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];
    }
    sort(a, a+10, less<int>());
    for (int i = 9; i > 6; i--){
        cout << a[i] << endl;
    }
}

C++: #include <iostream>                                             
#include <algorithm>                                            
#define N 10                                                    
using namespace std;                                            
                                                                
int main(void) {                                                
  int height[10];                                               
  for (int i=0; i<N; i++) {                                     
    cin >> height[i];                                           
  }                                                             
  sort(height,height+N);                                        
  reverse(height,height+N);                                     
  for (int i=0; i<3; i++) {                                     
    cout << height[i] << endl;                                  
  }                                                             
  return 0;                                                     
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
  vector<int> v;
  int n;
  while(cin >> n){
    v.push_back(n);
  }
  sort(v.begin(), v.end(), greater<int>());
  for(int i = 0; i < 3; i++){
    cout << v[i] << endl;
  }
  return 0;
}

C++: #include<stdio.h>

int main()
{
	int high[10];
	int cases;
	
	for(int i=0;i<9;i++)
	{
		scanf("%d",&high[i]);
	}
	
	
	for(int i=0;i<9;i++)
	{
		for(int j=i+1; j<10; j++)
		{
			if(high[i] < high[j])
			{
				cases = high[i];
				high[i] = high[j];
				high[j] = cases;
			}
		}
	}
	
	printf("%d\n",high[0]);
	printf("%d\n",high[1]);
	printf("%d\n",high[2]);
	
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int main(void)
{
    int a;
    vector<int> v;
    for (int i = 0; i < 10; i++)
    {
        cin >> a;
        v.push_back(a);
    }
    sort(v.begin(), v.end(), greater<int>());
    cout << v[0] << "\n";
    cout << v[1] << "\n";
    cout << v[2] << "\n";
}

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

C++: #include <stdio.h>
const int N = 15;

int main()
{
	int a[N]={0};
	for(int i = 0; i <= 9; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i <= 9; i++)
	{
		for(int j = i; j <= 9; j++)
		{
			if(a[i] < a[j])
			{
				int tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(int i = 0; i < 3; i++)
	{
		printf("%d\n", a[i]);
	}
	
	return 0;
}

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

int main()
{
	const int N = 10;
	int A[N];
	const int M = 3;
	int top[M] = {0};

	for(int i = 0; i < N; i++)
		cin>>A[i];

	for(int i = 0; i < N; i++)
	{
		if(top[0] < A[i])
		{
			top[2] = top[1];
			top[1] = top[0];
			top[0] = A[i];
		}
		else if(top[1]<A[i])
		{
			top[2] = top[1];
			top[1] = A[i];
		}
		else if(top[2] < A[i])
			top[2] = A[i];
	}


	for(int i = 0; i < M; i++)
		cout <<top[i] << endl;

	return 0;
}

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

int main() {
	int height;
	int top[3]={0,0,0};
	for(int i=0; i<10; i++){
		cin >> height;
		
		for(int j=0; j<3; j++){
			if(top[j]<=height){
				for(int k=2; k>2-j; k--){
					top[k]=top[k-1];
				}
				top[j]=height;
				break;
			}
		}
		
	}
	
	for(int i=0; i<3; i++){cout << top[i] << endl;}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
  
int main()
{
	int a[10];
	for(int b =0;b<10;b++)
	{
		cin>>a[b]>>endl;
		}
		sort(a.begin(),a.end());
		sort(a.begin(),a.end());
		for(int c =0;c<3;c++)
		cout<<a[c]<<endl;
		
	return 0;
		}

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

int main(){
	int h[10];
	
	for(int i = 0; i < 10, i++){
		cin >> h[i];
	}
	sort(h.begin(),h.end());
	
	for(int i = 0; i < 3, i++){
		cout << h[i] << endl;
	}
	
    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){
      rd = nd;
      nd = st;
      st = h[i];
    }else if(h[i]>nd){
      rd = nd;
      nd = h[i];
    }else if(h[i]>rd){
      rd = h[i];
    }
  }
  printf("%d\n%d\n%d\n",st,nd,rd);
}

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

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

C++: #include<iostream>

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

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

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

C++: //
// Created by tac on 2016/10/27.
//

#include <cstdlib>
#include <algorithm>
#include <functional>
#include <vector>
#include <iostream>

const int N_SIZE = 10000;

int main() {
    std::vector<int> v(N_SIZE);
    int n = 10;
    int s;
    for (int i = 0; i < n; ++i) {
        std::cin >> s;
        v.push_back(s);
    }
    std::sort(v.begin(), v.end(), std::greater<int>());
    for (int j = 0; j < 3; ++j) {
        std::cout << v[j] << std::endl;
    }
    return EXIT_SUCCESS;
}