Go: package main

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

func getsAsIntArray() (line []int) {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		str := scanner.Text()
		if str == "" {
			break
		}
		data, err := strconv.Atoi(str)
		if err != nil {
			break
		}
		line = append(line, data)
	}

	return
}

func main() {

	lines := getsAsIntArray()
	sort.Sort(sort.Reverse(sort.IntSlice(lines)))
	for i, v := range lines {
		if i < 3 {
			fmt.Println(v)
		}
	}
}

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 <bits/stdc++.h>

using namespace std;

int fir[3] = {0, 0, 0};

int* recal(int* arr, int newval){
    for(int i = 0; i < 3; i++){
        if(arr[i] <= newval){
            swap(arr[i], newval);
        }
    }
    return arr;
}

int main(){
    for(int i = 0; i < 10; i++){
        int t;
        cin >> t;
        recal(fir, t);
    }
    for(int i = 0; i <3; i++){
        cout << fir[i] << endl;
    }
    return 0;
}

C++: #include <stdio.h>

int num[13] ;
int ans[3] ;

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

C++: /*
　　　　 ∧＿∧　にっぽんちゃちゃちゃ
　／＼（　・∀・）／ヽ
（ ●　と　　　つ　● ）　にっぽんちゃちゃちゃ
　＼/⊂、 ノ　　＼ノ
　　　　　し'
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807


signed main()
{
  string xyz ="";
int x=0,y=0,z=0,w=0,i=0,j=0,n=0;
std::vector<int> v;
rep(i,10){
std::cin >> x;
v.push_back(x);
  }
  sort(rall(v));
rep(i,3){
  std::cout << v[i] << '\n';
}
}

C++: #include<stdio.h>
int main(){
    int l[10],r[10]={-1};
    int i,j,k,c[10],n=0;
    for(i=0;i<10;i++){
        c[i]=11;
    }
    for(i=0;i<10;i++){
        scanf("%d",&l[i]);
    }
    for(j=0;j<10;j++){
        for(i=0;i<10;i++){
            for(k=0;k<10;k++){
                if(c[k]==i){
                    n=1;
                }
            }
            if(!(n==1)){
                if(l[i]>=r[j]){
                    r[j]=l[i];
                    c[j]=i;
                }
            }
            n=0;
        }
    }
    for(i=0;i<3;i++){
        printf("%d\n",r[i]);
    }
    return 0;
}

C++: #include<stdio.h>
#include<iostream>

using namespace std;

int MAX(int a,int b){
	if(a>b) return a;
	else return b;
}

int MIN(int a,int b){
	if(a>b) return b;
	if(a<b) return a;
	else return b;
}


int main(){
	int moun[11];
	for(int i=0;i<10;i++)
		cin>>moun[i];
	int no1,no2,no3,n=0,p=0,w=0;
	
		no1=MAX(moun[n],moun[n+1]);
		for(n=2;n<8;n++)
		no1=MAX(no1,moun[n]);
		for(int o=0;o<10;o++){
			if(no1==moun[o])
				moun[o]=0;
		}

	    no2=MAX(moun[p],moun[p+1]);
		for(p=2;p<8;p++)
		no2=MAX(no2,moun[p]);
		for(int q=0;q<10;q++){
			if(no2==moun[q])
				moun[q]=0;
		}

		no3=MAX(moun[w],moun[w+1]);
		for(w=2;w<8;w++)
		no3=MAX(no3,moun[w]);
		for(int l=0;l<10;l++){
			if(no3==moun[l])
				moun[l]=0;
		}
		cout<<no1<<" "<<no2<<" "<<no3<<"\n";

	return 0;
}

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

const int MAX_N = 9;
int a[MAX_N];
  
int main(){

    for(int i=0; i<=MAX_N; i++){
        cin >> a[i];
    }
     
    sort(a,a+10);
    cout << a[9] << endl << a[8] << endl << a[7] << endl;

    return 0;
}

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

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

C++: #include <stdio.h>

int fir(const int *);
int sec(const int *);
int thi(const int *);

int main(void)
{
	int i, h[10];
	for (i = 0; i<10; i++){
		scanf("%d", &h[i]);
	}
	printf("%d\n", fir(h));
	printf("%d\n", sec(h));
	printf("%d\n", thi(h));
	return 0;
}

int fir(const int *h){
	int i, f = 0;
	for (i = 0; i<10; i++){
		f = f < h[i] ? h[i] : f;
	}
	return f;
}

int sec(const int *h){
	int i, f=0, s=0;
	for (i = 0; i<10; i++){
		f = f < h[i] ? h[i] : f;
	}
	for (i = 0; i<10; i++){
		s= f >= h[i] && s<h[i] ? h[i] :s;
	}
	return s;
}

int thi(const int *h){
	int i, f=0, s=0, t=0;
	for (i = 0; i<10; i++){
		f = f < h[i] ? h[i] : f;
	}
	for (i = 0; i<10; i++){
		s = f >= h[i] && s<h[i] ? h[i] : s;
	}
	for (i = 0; i<10; i++){
		t = f >= h[i] && t<h[i] ? h[i] : t;
	}
	return t;
}

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

}

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

using namespace std;

int main(int argc, char const *argv[])
{
    int a[10], i;
    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;
    }
    return 0;
}

C++: #include <iostream>

int main(){
	int first=0,second=0,third=0,height;
	for(int i=0;i<10;++i){
		std::cin>>height;
		if(height>first){
			third=second;
			second=first;
			first=height;
		}
		else if(height>second){
			third=second;
			second=height;
		}
		else if(height>third){
			third=height;
		}
	}
	std::cout<<first<<'\n'<<second<<'\n'<<third<<'\n';
	return 0;
}

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

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

int main(void)
{
    vector <int> a;
    int b;

    for (int i = 0; i < 10; i++){
    cin>>b;
a.push_back(b);
}
sort(a.begin(), a.end());
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],i,judge;
     for(i=0;i<10;i++) cin >> a[i];
     judge = 0;
     do{
       judge = 1;
       for(i=0;i<9;i++){
         if(a[i]<a[i+1]){
           swap(a[i],a[i+1]);
           judge = 0;
         }
       }
     }while(!judge);
 
     for(i=0;i<3;i++)
       cout << a[i] << endl;
 
   return 0;
}

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

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

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

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

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

  return 0;
}