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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    vector<int> A(10);
    for(int i = 0; 10 > i; i++){
        cin>>A[i];
    }
    sort(A.begin(),A.end(),greater<int>());
    for(int i = 0; 3 > i; i++){
        cout << A[i] << endl;
    }
}

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

#define REP( i, n )	for( int (i) = 0; (i) < (n); (i)++ )
#define ALL( x )	(x).begin(), (x).end()

int main() {
	vector<int> m(10);
	REP( i, 10 ) cin >> m[i];

	sort( ALL(m), greater<int>() );
	cout << m[0] << endl << m[1] << endl << m[2] << endl;
	
}

C++: #include<iostream>
#include<vector>
int main(){
	std::vector<int> vec(10);
	for(int i=0;i<10;i++){
		std::cin>>vec[i];
	}
	while(1){
		int a,b=0;
		for(int j=0;j<10;j++){
			if(vec[j]>vec[j+1]&&j+1<10){
				a=0;
				a=vec[j];
				vec[j]=vec[j+1];
				vec[j+1]=a;
				b++;
			}
		}
		if(b==0)break;
	}
	for(int i=9;i>=7;i++){
		std::cout<<vec[i]<<std::endl;
	}
	return 0;
}

C++: Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.Unacceptable submission.

C++: #include<stdio.h>
int main()
{
    int ara[12],i,j,t,n=10;
    for(i=0;i<n;i++)
    {
        scanf("%d", &ara[i]);
    }
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(ara[j]>ara[j+1])
            {
                t=ara[j];
                ara[j]=ara[j+1];
                ara[j+1]=t;
            }
        }
    }
    for(i=9;i>6;i--)
        printf("%d\n", ara[i]);
    return 0;
}

C++: #include <cstdio>
#include <set>
#include <iterator>

int main() {
    std::multiset<int> ms;
    int d;
    for (int i = 0; i < 10; ++i) {
        scanf("%d", &d);
        ms.insert(d);
    }
    for (auto i = ms.rbegin(); i != std::next(ms.rbegin(), 3); ++i) {
        printf("%d\n", *i);
    }
}

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

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

    sort(a, a+10);

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

    return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	int h[2];
	int i,j;
	for(i=0;i<=2;i++) h[1] = 0;
	for(i=0;i<=9;i++){
		cin>>j;
		if(j > h[0]) {h[1] = h[0]; h[0] = j;}
		else if (j > h[1]) {h[2] = h[1]; h[1] = j;}
		else if (j > h[2]) h[2] = j;
		else continue;
	}
	for(i=0;i<=2;i++){
		cout<<h[i]<<endl;
	}
	cin>>j;
	return 0;
}

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

using namespace std;


int main(){

  vector<int>h;

  for(int i = 0; i < 10; i++){
    int t;
    cin >> t;
    h.push_back(t);
  }
  sort(h.rbegin(),h.rend());

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

C++: #include <iostream>

int main()
{
	int a[10];
	int work = 0;

	for(int i = 0;i < 10;i++)
	{
		std::cin >> a[i];
		if(a[i] > 10000)
		{
			std::cout << "値が大きすぎます" << std::endl;
			i -= 1;
		}
	}
	/*そうだ、バブルソートやろう*/

	for(int j = 0;j < 10;j++)
	{
		for(int k = 9;k > j;k--)
		{
			if(a[k] > a[k-1])
			{
				work = a[k-1];
				a[k-1] = a[k];
				a[k] = work;
			}
		}
	}

	std::cout << a[0] << std::endl;
	std::cout << a[1] << std::endl;
	std::cout << a[2] << std::endl;



	return 0;
}

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

C++: #include <stdio.h>
int main(void)
{
	int n,m[10],l,s;
	for(n=0;n<10;n++)
	{
		scanf("%d",&m[n]);
	}
	for(n=0;n<10;n++)
	{
		for(l=n+1;l<10;l++)
		{
			if(m[n]<m[l])
			{
				s=m[n];
				m[n]=m[l];
				m[l]=s;
			}
		}
	}
	printf("%d %d %d\n",m[0],m[1],m[2]);
	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

int main() {
	const int len = 10;
	int arr[len];

	for (int i = 0; i < len; i++)
		cin >> arr[i];

	for (int i = 0; i < len; i++)
		for (int j = 0; j < len; j++)
			if (arr[i] < arr[j])
				swap(arr[i], arr[j]);

	cout << endl;

	for (int i = len - 1; len - 4 < i; i--)
		cout << arr[i] << endl;
}

C++: #include<stdio.h>

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

    int max1 = 0, max2 = 0, max3 = 0;
    for(i = 0; i <= 10; i++){
        if (height[i] > max1)
            max1 = height[i];
    }

    for(i = 0; i <= 10; i++){
        if (max1> height[i] > max2)
            max2 = height[i];
    }

    for(i = 0; i <= 10; i++){
        if (max2 > height[i] > max3)
            max3 = height[i];
    }

    printf("%d\n", max1);
    printf("%d\n", max2);
    printf("%d\n", max3);

    return 0;
}