Go: package main

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

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func toInt(str string) int {
	n, _ := strconv.Atoi(str)
	return n
}

func main() {
	lst := make([]int, 0)
	for i := 0; i < 10; i++ {
		lst = append(lst, toInt(readLine()))
	}
	sort.Ints(lst)
	for i := 9; i > 6; i-- {
		fmt.Println(lst[i])
	}
}

C++: #include <iostream>

using namespace std;

int main()
{
    int data[11];
    int temp;
    for(int a = 0;a<10;a++)
    {
        cin >> data[a];
        if(data[a]<0||data[a]>10000)return 0;
    }

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

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

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

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
int main(){
	priority_queue<int> pq;
	for(int i=0,x;i<10;i++)
		cin>>x,pq.push(x);
	for(int i=0;i<3;i++,pq.pop())
		cout<<pq.top()<<endl;
	return 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]){
			}
		}
	}
	for (int i=0;i,3;i++){
		cout<<takasa[i];
	}
	return 0;
}

C++: #include<iostream>
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;

}

C++: #include <cstdio>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main() {
	int ary[10];
	rep(i,10) {
		scanf(" %d", &ary[i]);
	}
	sort(ary, ary + 10, greater<int>());
	rep(i,3) {
		printf("%d\n", ary[i]);
	}
	return 0;
}

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

using namespace std;

int main()
{
    int montes[10];
    for (int i=0;i<10;i++){
    cin>>montes[i];}
    vector<int> montanas (montes, montes+10);
    sort (montanas.begin(), montanas.end());
    for (int i=9;i>6;i--){
    cout<<montanas[i]<<endl;}

    return 0;
}

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

using namespace std;

int cmp(int* a, int* b)
{
	return (*a < *b) ? 1 : ((*a > *b) ? -1 : 0);
}

int main()
{
	int dat[10];

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

	qsort(dat, 10, sizeof(int), reinterpret_cast<int(*) (const void*, const void*)>(cmp));

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

	return 0;
}

C++: #include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
#include <new>
#include <typeinfo>
#include <iterator>


typedef long long ll;
typedef unsigned long long ull;
constexpr ll mop = 1000000007;
constexpr ll mop2 = 998244353;

using namespace std;

int main() {
	vector<ll> v;
	v.resize(10);
	for (ll i = 0; i < 10; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end(), greater<ll>());
	for (ll i = 0; i < 3; i++) {
		cout << v[i] << endl;
	}
}

C++: #include <iostream>

int main() {
	int mt[10], limit = 10000;
	for ( int i = 0; i < 10; i++ ) {
		std::cin >> mt[ i ];
	}

	for ( int j = 0; j < 3; j++ ) {
		int max = 0;
		for ( int i = 0; i < 10; i++ ) {
			if ( max < mt[ i ] && mt[ i ] < limit ) {
				max = mt[ i ];
			}
		}
		std::cout << max << std::endl;
		limit = max;
	}
}

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];

  return(0);
}

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

using namespace std;

int data;
int mountain[10];
int i=0;

int main(){
	scanf("%d",&data);

	while((data != EOF) && (i < 10)){
		mountain[i] = data;
		i++;
		scanf("%d",&data);
	}

	sort(mountain, mountain + 10);

	for(int j=0;j<3;j++){
		printf("%d\n",mountain[j]);
	}

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())

using namespace std;



int main() {
	vector<int> v(10000);
	for (int i = 0; i < v.size(); i++) {
		cin >> v[i];
	}

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

	cout << v[9999] << endl << v[9998] << endl << v[9997] << endl;
	
	return 0;
}

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

using namespace std;

int main(){
    int i;
    int h[10];

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

    sort(h, h+10, greater<int>());

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

}

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


    return 0;
}

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

typedef long long ll;

int main(void)
{
    struct mount {
        ll h1st; ll h2nd; ll h3rd;
    } m;

    m.h1st = 0; m.h2nd = 0; m.h3rd = 0;

    ll mheight;
    for (int i = 0; i < 10; i++) {
        cin >> mheight;
        if (mheight > m.h1st) {
            m.h3rd = m.h2nd;
            m.h2nd = m.h1st;
            m.h1st = mheight;
        } else if (mheight > m.h2nd) {
            m.h3rd = m.h2nd;
            m.h2nd = mheight;
        } else if (mheight > m.h3rd) {
            m.h3rd = mheight;
        }
    }

    cout << m.h1st << endl;
    cout << m.h2nd << endl;
    cout << m.h3rd << endl;

    return 0;
}

C++: #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <deque>
#include <algorithm>
#include <iomanip>
#include <functional>

#define REP(i, n) for(int i = 0;i < (n); i++)
#define REP2(i, x, n) for(int i = (x); i < (n); i++)
#define REPR(i, n) for(int i = (n); i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

#define LL long long int
#define LD long double

#define PI 3.14159265358979

using namespace std;

//================================================
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	vector<int>ans(10);
	int N;

	REP(i, 10) cin >> ans[i];
	DESCSORT(ans);
	REP(i, 3) cout << ans[i] << "\n";
	return 0;
}