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>

using namespace std;
int data[10];
int temp;
int main()
{
    cout << "Input 10 Data(value = 1-10000): " << endl;
    for(int a = 0;a<10;a++)
    {
        cin >> data[a];
    }

    for(int x=0;x<10;x++)
    {
        for(int y=0;y<10;y++)
        {
            if(data[y]<data[x])
            {
                temp = data[x];
                data[x] = data[y];
                data[y] = temp;
            }
        }
    }
    cout << data[0] << endl;
    cout << data[1] << endl;
    cout << data[2] << endl;
}

C++: #include<cstdio>

int main(){
	int rank[] = {0,0,0};
	int t;
	for(int i = 0; i < 10 ; i++){
		scanf("%d", &t);
		if(t > rank[0]){
			rank[2] = rank[1];
			rank[1] = rank[0];
			rank[0] = t;
		}else if(t > rank[1]){
			rank[2] = rank[1];
			rank[1] = t;
		}else if(t > rank[2]){
			rank[2] = t;
		}
	}
	printf("%d\n%d\n%d\n", rank[0], rank[1], rank[2]);
	return 0;
}

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

int main() {
	int i,a[10];
	for(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 max[3]={0,0,0};
	int m;
	int i;
	
	for(i = 0; i< 10; i++){
		cin >> m;
		if(m > max[2]){
			if( m > max[1]){
				max[2] = max[1];
				if(m > max[0]){
					max[1] = max[0];
					max[0] = m;
				}
				else{
					max[1] = m;
				}
			}
			else{
				max[2] = m;
			}
		}
	}
	
	for(i=0;i<3;i++){
		cout << max[i] << endl;
	}
	
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int yama,top1=0,top2=0,top3=0;
    for(int i=0;i<10;i++){
        cin >> yama;
        if(top1<yama){
            top3 = top2;
            top2 = top1;
            top1 = yama;
        }
        else if(top2<yama){
            top3 = top2;
            top2 = yama;
        }
        else if(top3<yama){
            top3 = yama;
        }
    }
    cout << top1 << "\n" << top2 << "\n" << top3 << "\n";
}

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

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

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

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000009
#define EPS 1E-9

const int n = 10;
int h[n];

int main()
{
  rep(i, n) cin >> h[i];
  sort(h, h+n, greater<int>());

  cout << h[0] << endl << h[1] << endl << h[2] << endl;

  return 0;
}

C++: #include<iostream>
int main(){
	int a[10];
	int b;

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

	for (int i = 0; i < 10; i++){
		for (int j = i + 1; j < 11; j++){
			if (a[i] < a[j]){
				b = a[i];
				a[i] = a[j];
				a[j] = b;
			}
		}
	}

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

C++: #include<iostream>
using namespace std;
int main(){
  int a;
  int x=0;
  int y=0;
  int z=0;
  for(int i=1,i<=10,i++){
    cin >> a;
    if(a>x){
      x=a;
    }else if(y<a<=x){
      y=a;
    }else if(z<a<=y){
      z=a;
    }
  }
  cout << x << endl;
  cout << y << endl;
  cout << z << endl;
}

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

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

using namespace std;

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

C++: #include <iostream>
using namespace std;
int main(){
	int takasa[10];

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

	//????????????
	for (int i = 0; i < 9; i++) {
		for (int j = i+1; j < 10; j++) {
			if (takasa[i] <takasa[j]) {
				swap (takasa[i],takasa[j]);
			}
		}
	}
	
	for (int i = 0; i < 3; i++) {
		cout << takasa[i] << endl;
	}
	return 0;
}

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


int main() {
    vector<int> v(10);

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

    sort(v.begin(), v.end(), [](int a, int b){return a > b;});

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

    return 0;
}

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

int main()
{
	int n =10;
	vector < int > hills;
	hills.resize(n);
	for(int i = 0; i < n; ++i)
	{
		cin >> hills[i];
	}

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

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

	return 0;
}

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

C++: #include <stdio.h>


void insert(int a[],int n)
{
	int i,j,t;
	int x;


	for(i=1;i<n;i++){
		j=i;
		while(j>=1 && a[j-1] < a[j]){
			t=a[j];
			a[j]=a[j-1];
			a[j-1]=t;
			j--;
		}
	}
}



int main(void)
{
	int i;
	int a[10];

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



	printf("%d\n",a[0]);
	printf("%d\n",a[1]);
	printf("%d\n",a[2]);

	return 0;
}

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

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

C++: #include <cstdio>
#include <algorithm>
using namespace std;
int reverse(int x,int y){
    return x>y;
}

int main(){
    int i;
    int mount[10];
    int *p=&mount[0];
    for(i=0;i<10;i++){
        scanf("%d\n",p);
        p++;
    }
    sort(mount,mount+10,reverse(x,y));
    printf("%d\n%d\n%d\n",mount[0],mount[1],mount[2]);
    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;
  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+5);
 for(int i=9;i>6;i--)
  cout<<a[i]<<endl;
return 0;
}

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

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

  sort(a.begin(),a.end());

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

}