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 <vector>
#include <algorithm>

class top3hills {
public:
    top3hills();
    // top3hills(const top3hills& old);
    // ~top3hills();
    bool Run();

private:
    bool input();
    bool calc();
    void show() const;
public:
    static const int ReadMax;
    static const int ShowMax;

private:
    std::vector<int> m_mountData;   // List of mount
    std::vector<int> m_top3hills;   // List of top3 hills
};

const int top3hills::ReadMax = 10;
const int top3hills::ShowMax = 3;

top3hills::top3hills()
{

}

bool top3hills::Run()
{
    bool status = false;

    status = input();
    if (!status) {
        std::cerr << "input falure." << std::endl;
    }
    status = calc();
    if (!status) {
        std::cerr << "calc failure." << std::endl;
    }
    show();

    return true;
}

bool top3hills::input()
{
    int mountData = 0;

    for (int i = 0; i < ReadMax; ++i) {
        if (ReadMax <= i || ReadMax < m_mountData.size()) {
            return false;
        }
        std::cin >> mountData;
        m_mountData.push_back(mountData);
    }

    return true;
}

bool top3hills::calc()
{
    // Sort mount data
    std::sort(m_mountData.begin(), m_mountData.end());

    // Reverse mount data
    std::reverse(m_mountData.begin(), m_mountData.end());

    for (int i = 0; i < ShowMax; ++i) {
        if (ShowMax <= i || ShowMax < m_top3hills.size()) {
            return false;
        }
        m_top3hills.push_back(m_mountData.at(i));
    }

    return true;
}

void top3hills::show() const
{
    for (int i = 0; i < ShowMax; ++i) {
        std::cout << m_top3hills.at(i) << std::endl;
    }
}

int main()
{
    top3hills top3;
    top3.Run();
}

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

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

C++: lis=[];

for i in range(10):
    h=int(input());
    lis.append(h);
    
for i in range(10):
    for j in range(10):
        if lis[i]<lis[j]:
            a=lis[i];
            lis[i]=lis[j];
            lis[j]=a;
            
for i in range(3):
    print(lis[i]);

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

int main(){
int a[10] = {1819,2003,876,2840,1723,1673,3776,2848,1592,922};
int ma=0, aa=0;

for(int j=0;j<3;j++){
for(int i=0;i<10;i++){
if(ma < a[i]){
ma = a[i];
aa = i;
}
}
cout << ma << endl;
a[aa] = 0;
}

return 0;
}

C++: #include <iostream>
using namespace std;
int M[10];

void bubbleSort(int M[], int N) {
	int flag = 1;
	while (flag) {
		flag = 0;
		for (int i = N - 1; i > 0; --i) {
			if (M[i - 1] > M[i]) {
				int t = M[i];
				M[i] = M[i - 1];
				M[i - 1] = t;
				flag = 1;
			}
		}
	}
}

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

	bubbleSort(M, 10);

	for (int i = 1; i < 4; ++i) {
		cout << M[10 - i] << " ";
	}
	cout << endl;
}

C++: #include <iostream>
#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] << endl << h[8] << endl << h[7] << endl;
}

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

bool compareHeight(int v1, int v2) {
	return v2 < v1;
}

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

	return 0;
}

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

using namespace std;

int main(void){
	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()){
		cout << *it << "\n";
		++it;
	}

	return 0;
}

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

int main()
{
    int t[10];
    for(int i=0;i<10;i++)cin>>t[i];
    sort(t,t+10);
    for(int j=9;j>=7;j--)cout<<t[j]<<endl;
    return 0;
}

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

using namespace std;

int main(){
  vector<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[9-i] << endl;
  return 0;
}

C++: #include<stdio.h>

int main(void){

	int h[10];
	
	int i,j,t;
	for(i=0;i<10;i++){
		scanf("%d",&h[i]);
	}
	for(i=0;i<9;i++)
	{
		for(j=i;j<10;j++)
		{
			if(h[i]<h[j])
			{
			   t=h[i];
			   h[i]=h[j];
			   h[j]=t;
			}
		}
	}
	for(i=0;i<3;i++)
	{
		printf("%d\n",h[i]);
	}


	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
    int x[10001],i;
    for(i=0;0<=i && i<=10000;++i){
        cin>>x[i];
    }
    sort(x);
    cout<<x[0]<<endl;
    cout<<x[1]<<endl;
    cout<<x[2]<<endl;
    return 0;
}

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define rrev(i, m, n) for(int (i)=(n)-1; (i)>=(m); (i)--)
#define erev(i, m, n) for(int (i)=(n); (i)>=(m); (i)--)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T, class S> inline bool minup(T& m, S x){ return m>(T)x ? (m=(T)x, true) : false; }
template<class T, class S> inline bool maxup(T& m, S x){ return m<(T)x ? (m=(T)x, true) : false; }
template<class T> ostream& operator << (ostream& ros, const vector<T> vec){ vrep(v, vec) ros << *v << ' '; ros << '\b'; return ros; }
template<class T> ostream& operator << (ostream& ros, const pair<vector<T>, int> p){ rep(i, p.second) ros << p.first[i] << ' '; ros << '\b'; return ros; }
template<class T> ostream& operator << (ostream& ros, const pair<T*, int> p){ rep(i, p.second) ros << p.first[i] << ' '; ros << '\b'; return ros; }
template<class T, size_t S> ostream& operator << (ostream& ros, const T (&arr)[S]){ rep(i, S) ros << arr[i] << ' '; ros << '\b'; return ros; }

const int    INF = 1000000000;
const ll     MOD = 1000000007LL;
const double EPS = 1E-12;

const int n = 10;
int a[n];

int main()
{
  rep(i, n) cin >> a[i];

  sort(a, a+n, greater<int>());

  cout << mp(a, 3) << endl;

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
signed 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]<<"\n";
}
}

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

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

C++: #import<cstdio>
#import<deque>
#import<algorithm>
main(){int n,i;std::deque<int>h;while(~scanf("%d",&n))h.push_back(n);sort(h.begin(),h.end());for(i=9;i>6;)printf("%d\n",h[i--]);}