Go: package main

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

func main() {
	mountHeightList := make([]int64, 10)
	scanner := bufio.NewScanner(os.Stdin)
	for i := 0; i < 10; i++ {
		scanner.Scan()
		mountHeightList[i], _ = strconv.ParseInt(scanner.Text(), 10, 64)
	}

	sort.Slice(mountHeightList, func(i, j int) bool { return mountHeightList[i] > mountHeightList[j] })

	for i := 0; i < 3; i++ {
		fmt.Printf("%d\n", mountHeightList[i])
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <cstring>
#include <set>
#include <map>
#define rep(i, m, n) for (int i = m; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define ll long long
#define ull unsigned long long
#define push(a) push_back(a)
#define pop(a) pop_back(a)
#define debug(x) cout << #x << ": " << x << endl
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

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

ll n, a[10]={}, b;

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

C++: #include <iostream>
#include <queue>
using namespace std;
void AOJ0001::st(){
	int c;
	priority_queue<int>  pq;

	for (int i=0;i<10;i++){
		cin >> c;
		pq.push(c);
	}
	for (int i=0;i<3;i++){
		cout << pq.top() << endl;
		pq.pop();

	}

}

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

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

	for(int i=0;i<=9;i++){
		for(int j=i+1;j<=9;j++){
			if(height[i]<=height[j]){
				num=height[i];
				height[i]=height[j];
				height[j]=num;
			}
		}
	}
	for(int i=0;i<=2;i++)
		cout<<height[i]<<endl;
	return 0;
}

C++: #include<stdio.h>

void swap(int *xp, int *yp)
{
    int temp = *xp;
    *xp = *yp;
    *yp = temp;
}

void bubbleSort(int arr[], int n)
{
   int i, j;
   for (i = 0; i < n-1; i++)
       for (j = 0; j < n-i-1; j++)
           if (arr[j] < arr[j+1])
              swap(&arr[j], &arr[j+1]);
}


void printArray(int arr[], int size)
{
    int i;
    for (i=0; i < size; i++)
        printf("%d\n", arr[i]);
}


int main()
{
    int arr[10];
    for(int i=0; i<10; i++)
        scanf("%d", &arr[i]);
    int n = 10;
    bubbleSort(arr, n);
    printArray(arr, 3);
    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 = second;
			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>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cstdlib>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <sstream>

using namespace std;

int sort[100];

class qs{
	private:
	
	public:
	void QuickSort(int bottom,int top,int *data);
};

void qs::QuickSort(int bottom,int top,int *data){
	int lower, upper, div, temp;
	if (bottom >= top){
		return;
	}
	div = data[bottom];
	for (lower = bottom, upper = top; lower < upper;){
		while(lower <= upper && data[lower] <= div){
			lower++;
		}
		while(lower <= upper && data[upper] > div){
			upper--;
		}
		if(lower < upper){
			temp = data[lower];
			data[lower] = data[upper];
			data[upper] = temp;
		}
	}
	temp = data[bottom];
	data[bottom] = data[upper];
	data[upper] = temp;
	
	QuickSort(bottom, upper-1, data);
	QuickSort(upper+1,top,data);
}

int main(){
	int n;
	int i;
	
    n = 10;
	//cin >> n;
	for(i=0; i<n; ++i){
		cin >> sort[i];
	}
	
	qs qs01;
	qs01.QuickSort(0,n-1,sort);
	
	for ( i=n-1; i>n-4; --i){
		cout << sort[i] <<endl;
	}
	
	return 0;
}

C++: #include <stdio.h>

int main(){
	int height[10], rank[3] = {0};
	int i;
	
	for(i = 0; i < 10; i++){
    	scanf("%d\n", height[i]);

        if (rank[0] < height[i]){
        	rank[2] = rank[1];
        	rank[1] = rank[0];
        	rank[0] = height[i];
        }else if (rank[1] < height[i]){
        	rank[2] = rank[1];
        	rank[1] = height[i];
        }else if (rank[2] < height[i]){
        	rank[2] = height[i];
        }
    }

    for(i = 0; i < 3; i++){
    	printf("%d\n", rank[i]);
    }

	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
    
int main(){
	int data,m[10];

	
	for (int j=0;j<=9;j++){
			while(cin >> data){
			if (data<=10000 && data >= 0) {
			m[j]=data;
			break;
		}
			}
	}

for (int j=0;j<=9;j++){
for (int i=0;i<=9;i++){

	if (m[i] <= m[i+1])
		std::swap(m[i],m[i+1]);

}
}
 
for (int i=0;i<=9;i++){
cout <<  m[i] <<'\n';
}

    return 0;
}

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

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

using namespace std;

const int numOfMountain = 10;

int main(int argc, char** argv){
    int mountainBuf;
    vector<int> mountains;

    for(int i = 0; i <= numOfMountain; i++) {
        mountainBuf = atoi(argv[i]);
        mountains.push_back(mountainBuf);
    }

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

    vector<int>::iterator out = mountains.end();
    for(int i = 0; i < 3; i++) {
        cout << *--out << endl;
    }

    return 0;
}

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

int main(){
    int i,max=-1,max_1=-1,max_2=-1,a;
    for(i=0;i<=9;i++){
        cin >> a;
        if(a>max){
            max_2=max_1;
            max_1=max;
            max=a;
        }
        else if(a>max_1){
            max_2=max_1;
            max_1=a;
        }
        else if(a>max_2){
            max_2=a;
        }
    }
    cout << max << endl << max_1 << endl << max_2 << endl;
}

C++: #include <iostream>

int main() {
  int first=0, second=0, third=0;
  for (int i=0; i<10; ++i) {
    int a;
    std::cin >> a;
    if (a >= first) {third = second; second = first; first = a;}
    else if (a >= second) {third = second; second = a;}
    else if (a >= third) {third = a;}
  }
  std::cout << first << std::endl;
  std::cout << second << std::endl;
  std::cout << third << std::endl;

  return 0;
}

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

using namespace std;

int main(void){
	int count = 0;
	set<int, greater<int> > nums;
	for (int i=0; i<10; ++i){
		int num;
		cin >> num;
		nums.insert(num);
	}
	set<int, greater<int> >::iterator it = nums.begin();
	while (it != nums.end() && (n<3)){
		cout << *it << endl;
		++it;
	}

	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int n , mountain[11] ;
    for( int i=0 ; i<10 ; i++ )
        cin >> mountain[i] ;
    for( int i=0 ; i<10 ; i++ ){
        for( int j=i+1 ; j<10 ; j++ ){
            if( mountain[i] > mountain[j] )
                swap( mountain[i] , mountain[j] );
        }
    }
    cout << mountain[9] << endl << mountain[8] <<endl << mountain[7] << endl;
}

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

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

	return 0;
}