Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextInt() int {
	scanner.Scan()
	i, e := strconv.Atoi(scanner.Text())
	if e != nil {
		panic(e)
	}
	return i
}
func main() {
	heighs := make([]int, 10)
	for i := range heighs {
		heighs[i] = nextInt()
	}
	sort.Sort(sort.Reverse(sort.IntSlice(heighs)))
	for i := 0; i < 3; i++ {
		fmt.Println(heighs[i])
	}
}

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

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

int main(){
	std::vector<int>v(10);
	for(int i=0;i<10;i++){
		int a;std::cin>>a;
		v[i]=a;
	}
	std::sort(v.begin(),v.end());
	std::cout<<v[9]<<std::endl;
	std::cout<<v[8]<<std::endl;
	std::cout<<v[7]<<std::endl;
	return 0;
}

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

int main()
{
	int max = 0;
	int max2 = 0;
	int max3= 0;
	int a[10];
	bool flag = false;

	for (int i = 0; i < 10; i++) {
		scanf("%d", &a[i]);
		if (max < a[i]) max = a[i];
	}
	
	for (int i = 0; i < 10; i++) {
		if (!flag && a[i] == max) {
			flag = true;
			a[i] = 0;
		}
		if (max2 < a[i]) max2 = a[i];
	}

	flag = false;

	for (int i = 0; i < 10; i++) {
		if (!flag && a[i] == max2) {
			flag = true;
			a[i] = 0;
		}
		if (max3 < a[i]) max3 = a[i];
	}
		printf("%d\n", max);
		printf("%d\n", max2);
		printf("%d\n", max3);

		return (0);
	
}

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

using namespace std;

bool fn(int a, int b) {
    if (a > b) return true;
    
    return false;
}


int main() {
	int N = 10;
	int height;
	vector<int> mountains;
	
	while (N--) {
	    scanf("%d", &height);
	    
	    mountains.push_back(height);
	}
	
    sort(mountains.begin(), mountains.end(), fn);
    
    printf("%d\n", mountains.at(0));
    printf("%d\n", mountains.at(1));
    printf("%d\n", mountains.at(2));
	
	return 0;
}

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

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

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

int main()
{
    
    int i = 10,m[10];
    
    while(i>0){
        cin >> m[i];
        i--;
    }
    
    int max = m[0],index = 0;
    
    for(i = 0; i < 10 ; i++){
        if(max < m[i]){
            max = m[i];
            index = i;
        }
    }
    cout << m[index] << endl;
    m[index] = 0;
    
    max = m[0];
    index = 0;
    
    for(i = 0; i < 10 ; i++){
        if(max < m[i]){
            max = m[i];
            index = i;
        }
    }
    cout << m[index] << endl;
    m[index] = 0;
    max = m[0];
    index = 0;
    
    for(i = 0; i < 10 ; i++){
        if(max < m[i]){
            max = m[i];
            index = i;
        }
    }
    cout << m[index] << endl;

    m[index] = 0;
    
    return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int m[11],t;
	for(int i=1;i<=10;i++)
	{
		cin>>m[i];
	}
	for(int i=1;i<=10;i++)
	{
		for(int j=1;j<=10;j++)
		{
			t=m[i];
			m[i]=m[j];
			m[j]=t;
		}
	}
	cout<<m[1]<<endl;
	cout<<m[2]<<endl;
	cout<<m[3]<<endl;
	return 0;
}

C++: #include<stdio.h>
int main(){
	int list[10];
	int lank[3]={-1},chk[3]={11},f=0,ch=11;
	for(int i=0;i<10;i++){
		scanf("%d",&list[i]);
	}
	for(int c=0;c<3;c++){
		for(int i=0;i<10;i++){
			for(int j=0;j<3;j++){
				if(chk[j]==i){
					f=1;
				}
			}
			if(f==1){
				f=0;
			}else{
				if(lank[c]<=list[i]){
					lank[c]=list[i];
					ch=i;
				}
			}
		}
		chk[c]=ch;
	}
	for(int c=0;c<3;c++){
		printf("%d\n",lank[c]);
	}
	return 0;
}

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

int main() {
    vector<int> mountain;
    for(int i = 0; i < 10; i++){
      cin >> mountian.at(i);
    }
    sort(moutain.begin(), moutain.end());

    for (int i = 0; i < 3; i++) {
        cout << moutain.at(i) << endl;
    }
}

  
}

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

int main()
{
    int A[10];
       
    for (int i=1; i<=10; i++)
    {
        cin >> A[i];
    }
    
    sort (A, A+10);
    reverse(A, A+10);
    
    cout << endl;
    
    for (int e=1; e<=10; e++)
    {
        cout << A[e] << endl;
}

    return 0;
    
}

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

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

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

int main(){
	
	priority_queue<int>Q;

	for (int i = 0; i < 10; i++){
		int tmp; cin >> tmp;
		Q.push(tmp);
	}

	for (int i = 0; i < 3; i++){
		cout << Q.top() << endl;
		Q.pop();
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<stack>
#include<map>
#include<set> 
using namespace std;
int main(){
	int n,m;
	//cin>>n;
	int h[10];
	for(int i=0;i<=9;i++)
	cin>>h[i];
	sort(h,h+10);
	for(int i=9;i>=7;i--)
	cout<<h[i]<<endl;
	//system("pause");
	return 0;
}

C++: #include<iostream>

using namespace std;

int height[10];

int main(void)
{
	for(int i=0;i<10;i++){
		cin>>height[i];
	}
	for(int i=0;i<10;i++){
		int max=i;
		for(int j=i+1;j<10;j++){
			if(height[max]<height[i]){
				max=j;
			}
		}
		int tmp=height[i];
		height[i]=height[max];
		height[max]=tmp;
	}
	for(int i=0;i<3;i++){
		cout<<height[i]<<endl;
	}
}

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

int main()
{
	int H[10],temp,it;
	for(int i = 0;i < 10;i++)
		cin >> H[i];
	for(int j = 0;j < 3;j++){
		temp = 0;
		for(int i = 0;i < 10;i++)
			if(temp < H[i]){
				temp = H[i];
				it = i;
			}
		cout << temp << endl;
		H[it] = 0;
	}
	return 0;
}

C++: #include<stdio.h>
int main(void){
    int d,m1=0,m2=0,m3=0,i;
    for(i=0;i<10;i++){
        scanf("%d",&d);
        if(d>m1){
            m3=m2;
            m2=m1;
            m1=d;
        }else if(d>m2){
            m3=m2;
            m2=d;
        }else if(d>m3){
            m3=d;
        }
    }
    printf("%d\n",m1);
    printf("%d\n",m2);
    printf("%d\n",m3);
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int data[10],i,j,temp;
  for(i=0;i<10;i++){
    cin >> data[i];
  }
  for(i=0;i<10;i++){
    for(j=1;j<10;j++){
      if(data[j]>data[j-1]){
        temp=data[j];
	data[j]=data[j-1];
	data[j-1]=temp;
      }
    }
  }
  cout << data[0] << endl << data[1] << endl << data[2] << endl;
  return 0;
}

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

using namespace std;

int main() {
    int a=0, b=0, c=0;
    for(int i = 0; i < 10; ++i) {
        int temp;
        scanf("%d",&temp);
        if(temp>a) {
            c = b;
            b = a;
            a = temp;
        } else if(temp > b) {
            c = b;
            b = temp;
        } else if(temp > c) {
            c = temp;
        } else {
        }
    }
    printf("%d\n",a);
    printf("%d\n",b);
    printf("%d\n",c);
}

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

int main() {
	int tall;
	int top[3];

	for(int i=0;i<3;i++){
		top[i] = 0;
	}

	for(int i=0;i<10;i++){
		scanf("%d",&tall);
		if(tall >= top[0]){
			top[2] = top[1];
			top[1] = top[0];
			top[0] = tall;
		}else if(tall >= top[1]){
			top[2] = top[1];
			top[1] = tall;
		}else if(tall >= top[2]){
			top[2] = tall;
		}
	}

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