Go: package main

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

var (
	n  = 10
	sc = bufio.NewScanner(os.Stdin)
)

func main() {
	heights := make([]int, n, n)
	for i := 0; i < n; 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 A[10];
    for (int i = 0; i < 10; i++)
        cin >> A[i];
    int first = A[0], second = A[1], third = A[2];
    if (second < third)swap(second, third);
    if (first < second)swap(first, second);
    if (second < third)swap(second, third);
    for (int j = 0; j < 7; j++) {
        if (third < A[j + 3])third = A[j + 3];
        else if (second < A[j + 3]) {
            third = second;
            second = A[j + 3];
        }
        else if (first < A[j + 3]) {
            third = second;
            second = first;
            first = A[j + 3];
        }
    }
    cout << first << endl << second << endl << third << endl;
    return 0;
}

C++: #include<iostream>

using namespace std;
int main()
{
int mount[10];
for(int i=0;i<10;i++)
{
cin >> mount[i];
}
int max[3];
int count[2]={};
max[0] = mount[0];
max[1] = mount[0];
max[2] = mount[0];
for(int i=1;i<10;i++)
{
if(mount[i]>max[0])
{
max[0] = mount[i];
count[0]=i;
}
}
if(count[0]==0)
{
max[1]=mount[1];
}
for(int i=1;i<10;i++)
{
if(mount[i]>max[1]&&i!=count[0])
{
max[1] = mount[i];
count[1]=i;
}
}
if(count[0]==0)
{
max[2]=mount[1];
if(count[1]=1);
{
max[2]=mount[2];
}
}
for(int i=1;i<10;i++)
{
if(mount[i]>max[2]&&count[0]!=i&&count[1]!=i)
{
max[2] = mount[i];
}
}
cout << max[0] << endl;
cout << max[1] << endl;
cout << max[2] << endl;
return 0;
}

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

int main() {
  priority_queue<int> que;
  for (int i = 0; i < 10; i++) {
    int height;
    cin >> height;
    que.push(height);
  }
  cout << que.top() << endl; que.pop();
  cout << que.top() << endl; que.pop();
  cout << que.top() << endl; que.pop();
  return 0;
}

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

int main(){
    vector <int> v;
    int a;    
    for(int i-;i<10;i++){
        cin >> a;
        v.push_back(a);
    }

    sort(v.begin(),v.end());

    cout << v[0] << endl << v[1] << endl << v[2] << endl;

    return 0;

}

C++: #include <iostream>

using namespace std;

int main(void){
	int val[10];

	for(int i=0;i<10;i++)
		cin >> val[10];

	for(int i=0;i<9;i++)
		for(int j=0;j<9;j++)
			if(val[j]<val[j+1]){
				int tmp=val[j];
				val[j]=val[j+1];
				val[j+1]=tmp;
			}

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

	return 0;
}

C++: #include <iostream>


void bubbleSort(int *array, int size) {
  size -= 1;
  int temp = 0;

  for (int i = 0; i < size; i ++)
    for (int j = 0; j < size; j ++)
      if (array[j] < array[j + 1]) {
        temp = array[j];
        array[j] = array[j + 1];
        array[j + 1] = temp;
      }
}

int main() {
  int heights[10];
  int size = 0;
  for (int i = 0; i < 10; i ++)
    std::cin >> heights[i];
  size = sizeof(heights) / sizeof(*heights);

  bubbleSort(heights, size);

  for (int i = 0; i < 3; i ++)
    std::cout << heights[i] << std::endl;

  return 0;
}

C++: #include<iostream>
using namespace std;
  
int main(){
    int i;
    int A[10];
    for(i = 0; i < 10; i++){
        cin >> A[i];
    }
    int a = -1, b = -1, c = -1;
    for(i = 0; i < 10; i++){
        if(a < A[i]){ a = A[i]; }
        else if(b < A[i]){ b = A[i]; }
        else if(c < A[i]){ c = A[i]; }
    }
    cout << a << endl;
    cout << b << endl;
    cout << c << endl;
    return 0;
}

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

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

using namespace std;

int main() {
  vector<int> A(4);
  while(cin >> A[0]) {
    for(int i = 0; i < 3; i++) {
      if(A[i] >= A[i+1]) swap(A[i], A[i+1]);
      else break;
    }
  }
  cout << endl;
  for(int i = 3; i > 0; i--) {
    cout << A[i] << endl;
  }
  return 0;
}

C++: #include <iostream>

void sort(int *a);

int main()
{
    int i,high[10];
    for(i = 0;i < 10;++i){
        std::cin >> high[i];
    }
    sort(high[0]);
    std::cout << high[0];
    std::cout << high[1];
    std::cout << high[2];
}

void sort(int *a)
{
        int i,first = 0,secand = 0,third = 0;
        for(i = 0;i < 10;++i){
           if(first < *(a + i)){
               first = *(a + i);
           }else if(secand < *(a + i)){
               secand = *(a + i);
           }else if(third < *(a + i)){
               third = *(a + i);
           }
        }
        *a = first;
        *(a + 1) = secand;
        *(a + 2) = third;
}

C++: #include<iostream>
using namespace std;
 
int main(){
 
    int height[10];
    int TopOfThree[3];

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

    for(int i = 0;i < 3;i++)
    {
        TopOfThree[i] = height[0];
        for(int j = 1;j < 10 - i;i++)
        {
             int index = 0;

             if(TopOfThree[i] < height[j])
             {
                  TopOfThree[i] = height[j];
                  index = j;
             }
        }

        for(int k = index;k < 10;k++)
        {
            if(k == 9)
              height[k] = 0;
           else
              height[k] = height[k + 1];
        }
     }

     cout << TopOfThree[0] << endl << TopOfThree[1] << endl << TopOfThree[2] << endl;

    return 0;
}

C++: #include<stdio.h>
int main(){
  int high[10]={},i;
  int max=0;
  int sec=0;
  int thi=0;
   
  for(i=0;i<10;i++){
    scanf("%d",&high[i]);
  }
   
  for(i=0;i<10;i++)
    if(max<high[i])
      max=high[i];
     
  for(i=0;i<10;i++)
    if(high[i]<max && sec<high[i])
      sec=high[i];
   
  for(i=0;i<10;i++)
    if(high[i]<sec && thi<high[i])
      thi=high[i];
   
  printf("%d\n%d\n%d\n",max,sec,thi);
   
  return 0;
}

C++: a = Array.new(4,0)

10.times do
  a[3] = gets.chomp.to_i 
  3.times do |i|
    if a[2-i]<a[3-i]
      a[2-i], a[3-i] = a[3-i], a[2-i]
    else
      break
    end
  end
end
puts a[0]
puts a[1]
puts a[2]

C++: #include <iostream>
#include <algorithm>
#include <stdio.h>
#define pri(dt) printf("%d\n",dt)
#define RPE0(loopTotal)  for(int i=0;i<=(loopTotal);i++)
#define RPE(loopTotal)  for(int i=1;i<=(loopTotal);i++)

int data[9];

using namespace std;
int main(void){
    
    RPE0(9) scanf("%d",&data[i]);
    sort(data,data+9);
    RPE0(2) pri(data[i]);

}

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

using namespace std;

int main()
{
    int hi,a=10;
    vector<int> mou;
    while(a--)
    {
        cin>>hi;
        mou.push_back(hi);
    }
    sort(mou.rbegin(),mou.rend());
    for(int i=0;i<3;i++)
        cout<<mou[i]<<endl;
    return 0;
}

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