Go: package main

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

func main() {
        fp := os.Stdin
        scanner := bufio.NewScanner(fp)
        var lst [3]int

        for scanner.Scan() {
                num, _ := strconv.Atoi(scanner.Text())
                if lst[0] < num {
                        lst[2] = lst[1]
                        lst[1] = lst[0]
                        lst[0] = num
                } else if lst[1] < num {
                        lst[2] = lst[1]
                        lst[1] = num
                } else if lst[2] < num {
                        lst[2] = num
                }
        }

        for _, i := range lst {
                fmt.Printf("%d\n", i)
        }
}

C++: #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pb push_back

# define inOut(a,b) freopen(a,"r",stdin);freopen(b,"w",stdout);
# define RESET(a) memset(a,0,sizeof(a))
# define MEMO(a) memset(a,-1,sizeof(a))
# define DEBUG puts("Debug-Has-Come-Until-Here")


typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

int main(){
	cin.tie(NULL);
	
	int height, max1(0), max2(0), max3(0);
	while(scanf("%d", &height) != EOF){
		if (height >= max1){
			max3 = max2;
			max2 = max1;
			max1 = height;
		}else if (height >= max2){
			max3 = max2;
			max2 = height;
		}else if (height >= max3){
			max3 = height;
		}
	}
	printf("%d\n%d\n%d\n", max1, max2, max3);

	return 0;
}

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

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

C++: #include<stdio.h>
int main()
{
    int a[10];
    int z=0,y=0,x=0;
    int i;
    for(i=1;i<=10;i++){
        scanf("%d",&a[i]);
        if(x<a[i]){
            z=y;
            y=x;
            x=a[i];
        }
        else if(y<a[i]){
            z=y;
            y=a[i];
        }
        else if(z<a[i]){
            z=a[i];
        }
    }
    printf("%d\n%d\n%d",x,y,z);
    return 0;
}

C++: #include<iostream>
#include <stdio.h>
using namespace std;
 
int main(){
	int a[10];
    int fir=0;
	int sec=0;
	int thi=0;
	for(int i=0;i<10;i++){
	cin>>a[i];
	if(a[i]>fir){
	thi=sec;
	sec=fir;
	fir=a[i];}else
	if(a[i]>sec){
	thi=sec;
	sec=a[i];}else
	if(a[i]>thi){
	thi=a[i];}}
	cout<<fir<<endl<<sec<<endl<<thi<<endl;

	return 0;}

C++: #include<cstdio>
#include<algorithm>
using namespace std;
int a[12];
int main()
{
	scanf("%d%d%d%d%d%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4],&a[5],&a[6],&a[7],&a[8],&a[9]);
	sort(a,a+10);
	printf("%d\n%d\n%d",a[9],a[8],a[7]);
}

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

int main(){
    vector<int> v(10);
    int index = 0;  
    for(int i = 0; i< 10; i++){
        cin >> v[i];
    }
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
    cout << *max_element(v.begin(),v.end()) << endl;
    index = distance(v.begin(),max_element(v.begin(),v.end()));
    v[index] = 0;
}

C++: #include<stdio.h>
#include<algorithm>
int main(){
	int i,height[10]={};
	for(i=0;i<=9;i++){
		scanf("%d",&height[i]);
	}
	std::sort(height,height+10);
	for(i=9;i>=7;i--){
		printf("%d\n",height[i]);
	}
	return 0;

}

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

#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)

int main(int argc, char *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    vector<int> p(10);

    REP(i, 10)
    {
        cin >> p[i];
    }

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

    REP(i, 3)
    {
        cout << p[i] << endl;
    }

    return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int a = 0, b = 0, c = 0, d = 0;
	for (int i = 0; i < 10; i++){
		cin >> a;
		if (a>b){
			d = c;
			c = b;
			b = a;
		}
		else if (a > c){
			d = c;
			c = a;
		}
		else if (a > d){
			d = a;
		}
	}
	cout << b << endl << c << endl << d<< endl;
	return 0;
}

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

using namespace std;

int main() {
    int a[10];
	for(int i=0;i<=9;i++) std::cin>>a[i];
 std::sort(a, a + 10, greater<int>());            // ツソツーツトツつキツづゥツ。
    for (int j = 0; j < 3; j++) {
        std::cout << a[j] << ", ";    // ツ個仰嘉環づーツプツδ環δ督トツつオツづづ敖づゥツ。
    }
    return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
	int sum,heights[10];
	for(int i = 0; i<10;i++)
	{
		cin>>heights[i];
	}
	for(int i = 1;i<10;i++)
		if(heights[i]>heights[0])
		{
			sum = heights[i];
			heights[i] = heights[0];
			heights[0] = sum;
		}
		//heights[0] = heights[i]>heights[0]?heights[i]:heights[0];
	for(int i = 2;i<10;i++)
		if(heights[i]>heights[1])
		{
			sum = heights[i];
			heights[i] = heights[1];
			heights[1] = sum;
		}
		//heights[1] = heights[i]>heights[1]?heights[i]:heights[1];
	for(int i = 3;i<10;i++)
		if(heights[i]>heights[2])
		{
			sum = heights[i];
			heights[i] = heights[2];
			heights[2] = sum;
		}
		//heights[2] = heights[i]>heights[2]?heights[i]:heights[2];
	cout<<heights[0]<<endl;
	cout<<heights[1]<<endl;
	cout<<heights[2]<<endl;
	system("pause");
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int main()
{
    vector<int>v;
    int i,a;
    for(i=0;i<10;i++)
    {
        cin >> a;
        v.push_back(a);
    }
    sort(v.rbegin(),v.rend());
    for(i=0;i<3;i++)
    {
        cout << v[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);
for(int i=9;i>6;i--)cout << a[i] << endl;
}

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

int main() {
	int h[10];

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

	std::sort(h, h + 10);

	std::cout
		<< h[9] << std::endl
		<< h[8] << std::endl
		<< h[7] << std::endl;
}

C++: #include <stdio.h>

int main(void)
{
	int i,j,mt_height[10];

	for (i = 0; i < 10; i++)
	{
		printf("?±±?????????%d???", i + 1);
		scanf("%d",&mt_height[i]);
	}

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

	for (i = 0; i < 3; i++)
		printf("%d????????????????±±???%d\n",i+1, mt_height[i]);

	return 0;
}

C++: #include <iostream>
  
using namespace std;
int a, b;  
  
void solve()  
{  
    int res = 0;  
  
    a += b;  
  
    for (; a; a /= 10)  
        res++;  
  
    cout << res << endl;  
}  
  
int main()  
{  
    while (cin >> a >> b)  
        solve();  
  
    return 0;  
}

C++: #include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int i, arr[100];
for (i=0;i<10;i++)
scanf ("%d", &arr[i]);
printf ("%d\n", arr[9]);
printf ("%d\n", arr[8]);
printf ("%d\n", arr[7]);
return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int a[10];
    int a1=0,a2=0,a3=0,temp;
    for(int i=0;i<10;i++){
        cin>>a[i];
        if(a[i]>a3 && a[i]<a2 && a[i]<a1)
            a3=a[i];
        if(a[i]>a3 && a[i]>a2 && a[i]<a1)
            a2=a[i];
        if(a[i]>a3 && a[i]>a2 && a[i]>a1)
            a1=a[i];
    }
    cout<<a1<<endl;
    cout<<a2<<endl;
    cout<<a3<<endl;

    return 0;
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<stack>
#include<cstdio>

using namespace std;

int main(void)
{
  int a[10]={};
  int i=0;
  int j=0;

  for(i=0;i<10;i++)
    cin>>a[i];

  sort(a,a+10);

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

}