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>
using namespace std;

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

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

int main()
{
	int x[10];
	int i,j,tmp;
	for(i=0;i<10;i++){
		cin >> x[i];
	}
	for(i=0;i<9;i++){
		for(j=9;j>i;j--){
			if(x[j]<x[j-1]){
				tmp = x[j];
				x[j] = x[j-1];
				x[j-1] = x[j];
			}
		}
	}
	cout <<x[9] <<endl;
	cout <<x[8] <<endl;
	cout <<x[7] <<endl;
		
		
		
	
	return 0;
}

C++: #include <stdio.h>

const int N = 15;
int main()
{	
		int a[N] = {0};
	
		for(int i = 0;i < 10;i++)
		{
			scanf("%d", &a[i]);
		}
		for(int i = 0;i < 10;i++)
		{
		for(int j = i;j < 10;j++)
		{
			if(a[i] < a[j])
			{
				int tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
			 }
		}
		for(int i = 0;i < 3;i++)	 
		{
			printf("%d\n", a[i]);
			 }			 
}

C++: #include<stdio.h>
int main(void) {
	int a, b, c, m[12],top=0,second=0,thread=0;
	for (size_t i = 0; i < 10; i++)
	{
		scanf("%d", &a);
		if (a > top)
		{
			thread = second;
			second = top;
			top = a;
		}
		else
		{
			if (a>second)
			{
				thread = second;
				second = a;
			}
			else
			{
				if (a>thread)
				{
					thread = a;
				}
			}
		}
	}
	printf("%d\n%d\n%d\n", top, second, thread);
	return 0;
}

C++: import sys

arr = []
for i in sys.stdin:
    arr.append(int(i))

arr.sort()
arr.reverse()
for i in range(3):
    print(arr[i])

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

int main(int argc, char* argv[]) {
  int h1=0, h2=0, h3=0, h;
  for(int i=1;i<10;i++){
    cin >> h;
    if(h>h3){
      h3 = h;
      if(h3>h2){
        swap(h3, h2);
        if(h2>h1){
          swap(h2, h1);
        }
      }
    }
  }
  cout << h1 << endl;
  cout << h2 << endl;
  cout << h3 << 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=9;i>=7;i--){
		cout << h[i] << endl;
	}

	return 0;
}

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

using namespace std;

int main()
{
int a[10];
for(int i=0;i<10;i++){scanf("%d",&a[i]);}
sort(a,a+10,greater<int>());
printf("%d\n%d\n%d\n",a[0],a[1],a[2]);
}

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 = 0; k < 9; k++){
				if(temp[0] < 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;

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

    int tmp;
    for(int i = 0; i < 10; i++) {
        for(int j = 9; j > i; j--) {
            if(height[j] < height[j-1]) {
                tmp = height[j];
                height[j] = height[j-1];
                height[j-1] = tmp;
            }
        }
    }

    cout << height[9] << endl;
    cout << height[8] << endl;
    cout << height[7] << 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;
    return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
#include<functional>
#include<queue>
#include<math.h>
#define INF 999999

using namespace std;

int main()
{
	int h[11];

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

	for (int i = 0; i < 3; i++) {
		cout << h[i] << endl;
	}

	return 0;
}

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

int main(){
	vector<int> v;
	for(int i = 0; i < 10; i++){
		int input;
		cin >> input;
		v.push_back(input);
	}

	sort(v.begin(), v.end(), greater<int>());

	cout << v.at(0) << endl << v.at(1) << endl << v.at(2) << endl;

	return 0;
}

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

int main(){
	for(int i = 1 ; i <= 9 ; i++){
		for(int j = 1 ; j <= 9 ; j++)
			cout << i << "x" << j << "=" << i*j << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  vector<int> v;
  int h;
  while (cin >> h) {
    v.push_back(h);
  }
  sort(v.begin(), v.end());
  int s = v.size();
  cout << v[s-1] << endl << v[s-2] << endl << v[s-3] << endl;
}

C++: #include<iostream>
using namespace std;
  
int main(void){
  
  int h[10];
　int a = 0;
  
  std::cin >> h;
  
  for(int j=0; j<3; j++){
    for(int i=0; i<10; i++){
        if(a<h[i]) a = i;
    }
    cout << h[a] << endl; 
    h[a] = 0;
  }  
  
  return 0;
}

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

int main(){
	
	int height[10] = {};

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

	int f = INT_MIN, s = INT_MIN, t = INT_MIN;

	for (int i = 0; i < 9; i++){
		if (height[i] >= t){
			t = height[i];
		}
		if (t >= s){
			swap(s, t);
		}
		if (s >= f){
		swap(f,s);
		}
	}
    
	cout << f << "\n" << s << "\n" << t << endl;

		return 0;
}

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

int main(){
	
	//use vector
	std::vector<int> height(10); // create height[10]
	
	// input
	for(int i = 0; i < 10; ++i){
		std::cin >> height[i];
	}
	
	//sort
	std::sort(height.begin(), height.end(), std::greater<int>());
	
	//output
	for(int i = 0; i < 3; ++i){
		std::cout << height[i] << std::endl;
	}
	
	return 0;
}

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

int main(void)
{
    int a;
    int b[3];
    for (int i = 0; i < 10; i++)
    {
        cin >> a;
        if(a>b[0])
        {
            b[2] = b[1];
            b[1] = b[0];
            b[0] = a;
        }
        else if(a>b[1])
        {
            b[2] = b[1];
            b[1] = a;
        }
        else if(a>b[2])
        {
            b[2] = a;
        }

    }

    for (int i = 0; i < 3; i++)
    {
        cout << b[i] << "\n";
    }

}

C++: #include<iostream>
using namespace std;
void swap (int &x,int &y)
{
 int t;
 if(x>y)
 {
 	t=y;y=x;x=t;
 }	
}
int main()
{
	int a[10],i,j;
	cin>>a[0]>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7]>>a[8]>>a[9];
	for(i=0;i<10;i++)
	{
		if(a[i]<0||a[i]>10000)return 0;
	}
	for(j=9;j>6;j--)
	{
		for(i=0;i<j;i++)
		swap(a[i],a[i+1]);
	}
	cout<<a[9]<<endl<<a[8]<<endl<<a[7];
	return 1;
}

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

int main(){

	int hight[10];
	int num;
	int baffer;
	int flag=1;

	for(num=0;num!=10;num++)
	{
		cin>>hight[num];
	};

	while(flag!=0){
		flag=0;
	for(num=0;num!=10;num++)
	{	if(num=9)break;
		if(hight[num]<hight[(num+1)]){

		baffer=hight[num];
		hight[num]=hight[(num+1)];
		hight[(num+1)]=baffer;

		flag++;}
		
	};

	};

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

return 0;
}