Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; 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>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;

int main(){

??????vector<int> data;

    for(int i=0;i<10;i++)
    {
       int input;
       cin>>input;
       data.push_back(input);
    }
    
    sort(data.begin(),data.end(),greater<int>());
    
    for(int i=0;i<3;i++)
    {
       cout<<data[i]<<endl;
    }

    return 0;
}

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

int main(){
    int hest[3];
    for(int i=0,int h=0;i<10;i++){
        std::cin>>h;
        for(int j=0;j<3;j++){
            if(hest[i]<h){
                hest[i] = h;
            }
        }
    }

    for(int j=0;j<3;j++){
        std::cout<<hest[i]<<std::endl;
    }

    return 0;
}

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

int main(){

	int str[10];
	int tmp = 0;
	int max[3];

	for (int i = 0; i < 10; i++) {
		scanf("%d",str[i]);
	}
	
	for(int j =0; j < 10; j++) {
		if( max[0] < str[j] ) {
			max[0] = str[j];
		}
	}
	for(int j =0; j < 10; j++) {
		if( max[1] < str[j] & str[j] != max[0]) {
			max[1] = str[j];
		}
	}
	for(int j =0; j < 10; j++) {
		if( max[2] < str[j] & str[j] != max[0] & str[j] != max[1]) {
			max[2] = str[j];
		}
	}
	
	printf("%d\n",max[0]);
	printf("%d\n",max[1]);
	printf("%d\n",max[2]);
	
}

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, less<int>());
	cout << a[9] << endl;
	cout << a[8] << endl;
	cout << a[7] << endl;
}

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

int main() {

    int first = 0;
    int second = 0;
    int third = 0;
    int height;

    for(int i = 0; i < 10; i++) {
        cin >> height;
        if (height >= first) {
            third = second;
            second = first;
            first = height;
        } else if (height >= second) {
            third = second;
            second = height;
        } else if (height >= third) {
            third = height;
        }

    }

    cout << first << endl << second << endl << third << endl;
     
    return 0;
}

C++: #include<iostream>
#include<vector>
int main(){
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	int a=0;
	for(int i=0;i<10;i++){
		if(a<vec[i])a=vec[i];
	}
	std::cout<<a<<std::endl;
	int b=0;
	for(int i=0;i<10;i++){
		if(b<vec[i]&&vec[i]!=a)b=vec[i];
	}
	std::cout<<b<<std::endl;
	int c=0;
	for(int i=0;i<10;i++){
		if(c<vec[i]&&vec[i]!=a&&vec[i]!=b)c=vec[i];
	}
	std::cout<<c<<std::endl;
	return 0;
}

C++: #include <iostream>

using namespace std;
#define total 10


int main (void){

	int height[total];
	for(int i=0;i<total;i++){
		cin>>height[i];
		while(height[i]<0||height[i]>10000){
			cin>>height[i];
		}
	}
	int temp=0;
	for(int i=0;i<total;i++){
		for(int j=i+1;j<total;j++){
			if(height[i]<height[j]){
				temp=height[i];
				height[i]=height[j];
				height[j]=temp;
			}
		}
	}
	cout<<height[0]<<endl<<
		height[1]<<endl<<
		height[2]<<endl;
}

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

int main(){
	int max1 = 0, max2 = 0, max3 = 0, height;
	while(cin >> height) {
		if (height > max1) {
			max3 = max2;
			max2 = max1;
			max1 = height;
		}
		else if (height > max2) {
			max3 = max2;
			max2 = height;
		}
		else if (height > max3)
			max3 = height;
	}
	cout << max1 << endl;
	cout << max2 << endl;
	cout << max3 << endl;
	return 0;
}

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

int main(){
    int i, f, s, t, h;
    f = -1;
    s = -1;
    t = -1;
    for (i = 0; i < 10; i++) {
        scanf("%d", &h);
        if (h > f) {
        	t = s;
        	s = f;
        	f = h;
        }
        else if (h > s) {
        	t = s;
        	s = h;
        }
        else if (h > t) {
        	t = h;
        }
    }
    printf("%d\n%d\n%d\n", f, s, t);
    return 0;
}

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

using namespace std;

int main(){
  int i,j;
  int no1=0, no2=0, no3 = 0;
  int cur=0;
  for(i=0; i<10; i++){
    cin>>cur;
    if(cur>=no1){
      no3= no2;
      no2= no1;
      no1 = cur;
    }else if(cur>=no2){
      no3= no2;
      no2= cur;
    }else if(cur>=no3){
      no3= cur;
    }
  }
  cout << no1 << endl;
  cout << no2 << endl;
  cout << no3 << endl;

    return 0;
}

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

int main(){
	bool flag;
	int result[3],buf,temp[10];
	for(int i = 0; i < 10; i++){
		cin >> temp[i];
	}
	for(int l = 0; l < 3; l++){
		while(1){
			for(int j = l; j < 9; j++){
				if(temp[j] < temp[j+1]){
					buf = temp[j+1];
					temp[j+1] = temp[j];
					temp[j] = buf;
				}
			}
			flag = false;
			for(int k = l; k < 9; k++){
				cout << "reached!" << endl;
				if(temp[l] < temp[k]) flag = true;
			}
			if(flag != true){
				result[l] = temp[l];
				break;
			}
		}
	}
	cout << result[0] << endl;
	cout << result[1] << endl;
	cout << result[2] << endl;
	return 0;
}

C++: #include<iostream>

using namespace std;

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

C++: #include<iostream>
#include<deque>
#include<algorithm>
using namespace std;main(){int n,i;deque<int>h;while(cin>>n)h.push_back(n);sort(h.begin(),h.end());for(i=9;i>6;)cout<<h[i--]<<endl;}

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

int high[11] = {0};

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n[10];
  for(int i=0;i<10;i++){
    cin>>n[i];
  }
  sort(n,n+10);
  cout<<n[9]<<endl;
  cout<<n[8]<<endl;
  cout<<n[7]<<endl;
}

C++: #include<stdio.h>

int main()
{
	int high[10];
	int i, j, temp;
	
	for(i = 0; i < 10; i++){
		scanf("%d",&high[i]);
	}
	
	for (i = 0; i < 9; i++){
		for (j = 9; j > i; j--){
			if (high[j - 1] < high[j]){
				temp = high[j];
				high[j] = high[j - 1];
				high[j - 1]= temp;
			}
		}
	
	}
	printf("%d\n%d\n%d",high[0], high[1], high[2]);
	
	return 0;
}

C++: #include <iostream>

using namespace std;

void buble_sort(int high[]){
    int i,j,v;

    for(i = 0;i < 9;i++){
        v = i;
        for(j = i;j <= 9;j++){
            if(high[v] < high[j]){
                v = j;
            }
        }
        int box = high[i];
        high[i] = high[v];
        high[v] = box;

    }
}

int main() {
    int i,high[10];

    for (i = 0;i <= 9;i++){
        cin >> high[i];
    }

    buble_sort(high);

    cout << endl;

    for(i = 0;i <= 2;i++){
        cout << high[i] << endl;
    }

    return 0;
}

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

int i, m[10];

int main(void)
{
  for(i = 0; i < 10; i++)
    scanf("%d",&m[i]);

  sort(m,m+10);

  printf("%d\n%d\n%d\n",m[9],m[8],m[7]);
  return 0;
}

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

using namespace std;

int a[10];

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