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 <bits/stdc++.h>

using namespace std;
int a[12];
int main(){
	for(int i=1; i<=10;i++){
		cin>>a[i];
	}
	sort(a+1, a+11);
	cout<<a[10]<<endl;
	cout<<a[9]<<endl;
	cout<<a[8]<<endl;
}

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>

#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)

using namespace std;

int main(void){
    
    int high[100] = {0};
    int temp;
    REP(i, 10)
    cin >> high[i];
    REP(i,9)
    REP(j,9)
    {
        if(high[j] <high[j+1])
        {
            temp = high[j+1];
            high[j+1] = high[j];
            high[j] = temp;
        }
    }
    REP(i,3)
    printf("%d\n",high[i]);
    return 0;


}

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

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

C++: /*#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

void input() {
	CI N >> W;

	int temp;

	for (int i = 0; i < N;i++) {
		CI temp;
		value.push_back(temp);
		CI temp;
		weight.push_back(temp);
	}


	return;
}


int main(void) {
	input();

	for (int i = 0; i < N;i++) {
		for (int j = 0; j <= W;j++) {
			dp[i + 1][j] = max(dp[i + 1][j], value[i] + dp[i][j - weight[i]]);
		}
	}

	CO dp[N][W] E


	return 0;
}
*/

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



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

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;


double tempd = 0.0;

int first;
int second;
int third;

int mountain;

void input() {
	

	return;
}

int main(void) {
	for (int i = 0; i < 10; i++) {
		CI mountain;
		if (mountain >= first) {
			third = second;
			second = first;
			first = mountain;
		}
		else {
			if (mountain >= second) {
				third = second;
				second = mountain;
			}
			else {
				if (mountain > third) {
					third = mountain;
				}
			}
		}
	}

	CO first E
	CO second E
	CO third E

	return 0;
}

C++: #include <iostream>
#define N 10

using namespace std;

void swap(int& a, int& b){
	int tmp = a;
	a = b;
	b = tmp;
}

void bubble_sort(int mountain[N]){
	for (int i=0; i<N; ++i){
		for (int j=0; j<(N-i); ++j){
			if (mountain[j] < mountain[j+1]){
				swap(mountain[j], mountain[j+1]);
			}
		}
	}
}

int main(void){
	int mountain[N];
	for (int i=0; i<N; ++i){
		int tmp;
		do{
			cin >> tmp;
		}while ((tmp<0) || (10000 < tmp));
		mountain[i] = tmp;
	}
	bubble_sort(mountain);
	//cout << "output" << endl;
	for (int i=0; i<3; ++i){
		cout << mountain[i] << 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);
 
    cout<<a[9]<<endl<<a[8]<<endl<<a[7]<<endl;
 
}

C++: #include<stdio.h>
#include<algorithm>

using namespace std;
int main()
{
    int a[100],n,i;
    scanf("%d",&n);

    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a,a+n);
    for(i=0;i<n;i++)
    {
    printf("%d\n%d\n%d",a[n-1],a[n-2],a[n-3]);}
    return 0;
}

C++: #include<bits/stdc++.h>
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[9 - i] << endl;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;
int data[10];
int temp;
int main()
{
    cout << "Input 10 Data(value = 1-10000): " << endl;
    for(int a = 0;a<10;a++)
    {
        cin >> data[a];
    }

    for(int x=0;x<10;x++)
    {
        for(int y=0;y<10;y++)
        {
            if(data[y]<data[x])
            {
                temp = data[x];
                data[x] = data[y];
                data[y] = temp;
            }
        }
    }
    cout << data[0] << endl;
    cout << data[1] << endl;
    cout << data[2] << endl;
}

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


int main(){
	int count[10001],tmp,num=3;
	for(int i=0;i<10001;i++)count[i]=0;

	for(int i=0;i<10;i++){
		scanf("%d",&tmp);
		count[tmp]++;
	}

	for(int i=10000;i>=0&&num>0;i--){
		if(count[i]>0){
			for(int k=0;k<count[i]&&num>0;k++){
				printf("%d\n",i);
				num--;
			}
		}
	}

    return 0;
}

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

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

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

C++: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#include <cmath>
#include <map>
#include <utility>
#include <numeric>
#include <set>
#include <map>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define _USE_MATH_DEFINES

using namespace std;

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

int main() {

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

	sort(h, h + 10);

	cout << h[9] << endl;
	cout << h[8] << endl;
	cout << h[7] << endl;

	return 0;

}