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 <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int main() {
  vector<int> a(10);
  int max;
  size_t idx;
  vector<int>::iterator itr;
  
  for(size_t i = 0; i < a.size(); ++i) {
	cin >> a[i];
  }

  for(int i = 0; i < 3; i++) {
	itr = max_element(a.begin(), a.end());
	idx = distance(a.begin(), itr);
	cout << *max_element(a.begin(), a.end()) << endl;
	a[idx] = 0;
  }
  return 0;
}

C++: #include<iostream>
using std::cin;
using std::cout;
using std::endl ;
int main()
{
	int b[10];
	int i=0,j;
	for(;i<10;i++)
		cin>>b[i];
	int t;
	for(i=0;i<3;i++)
	{
		for(j=0;j+i<9;j++)
			while(b[j]>b[j+1])
			{	t=b[j];b[j]=b[j+1];b[j+1]=t;}
		cout<<b[j]<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <string>
#include <sstream>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repn(i, n) for(int i = 1; i <= (int)n; ++i)
#define pb push_back
#define lb lower_bound
#define mp make_pair
#define ite iterator
#define max2(x, y) ((x) > (y)) ? (x) : (y)
#define max3(x,y,z) max2((x), max2((y),(z)))
#define max4(v,w,x,y) max2(max2((v),(w)), max2((x),(y)))
#define min2(x, y) ((x) > (y)) ? (y) : (x)
#define min3(x,y,z) min2((x), min2((y),(z)))
#define min4(v,w,x,y) min2(min2((v),(w)), min2((x),(y)))
#define ul unsigned long
#define ull unsigned long long
#define INF 1000000007
#define MOD 1000000007
#define fs first
#define sd second

template<typename T>
bool elem(set<T> st, T val){
	return (st.find(val) != st.end());
}

template<typename T>
void printv(vector<T> vt){
    rep(i, vt.size() - 1)
        cout << vt[i] << " ";
    cout << vt[vt.size() - 1] << endl;
}

typedef vector<int> vint;
typedef vector<ul> vul;
typedef vector<ull> vull;
typedef pair<int, int> pii;

int main(void){
    vint a;
    int d;
    while(cin >> d) a.pb(d);
    sort(a.begin(), a.end());
    rep(i, a.size())
        cout << a[i] << endl;
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
 
__int128 a[15];
 
int main(){
    for(int i=0;i<10;i++){
        cin>>a[i];
    }
    sort(a, a+10);
    cout<<a[9]<<endl
        <<a[8]<<endl
        <<a[7]<<endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
bool myfun(int a,int b){
    return a > b;
}
int main()
{
    int n;
    vector<int>vec;
    vector<int>::iterator it;
    for(int i=1;i<=10;i++){
        cin>>n;
        vec.push_back(n);
    }
    sort(vec.begin(),vec.end(),myfun);
    for(int i=0;i<3;i++){
        cout<<vec[i]<<endl;
    }
    return 0;
}

C++: #include<iostream>
 using namespace std;
int main(){
int input[10];
int first;
int second;
int third;
for(int i=0,i<10,i++){
cin>>input[i];
if(first<input){first = input[i];}else 
if(second<input){second = input[i];}else 
if(third<input){third = input[i];}
}
cout<<first<<endl;cout<<second<<endl;cout<<third<<endl;
return 0;

}

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

const static int MAX = 10000;

int main() {
    int R[MAX]={0};
    int e;

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

    int cnt = 0;
    for (int j = MAX; j >= 0 ; j--){

        if  (cnt >= 3) break;

        if (R[j] != 0){
            cout << R[j] << endl;
            cnt++;
        }
    }
    return 0;
}

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

using namespace std;

int main()
{
  vector<int> data;

  for(int i=0;i<10;i++)
  {
    int input;
    cin>>input;
    data.push_back(input);
  }
  
  sort(data.begin(),data.end(),greater<int>());

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

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

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

    return 0;
}

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

int main() {
	std::array<int, 10> heights;
	for (auto& val : heights)
		std::cin >> val;
	std::sort(heights.begin(), heights.end(), [](int x, int y){return x > y;});
	for (int i = 0; i < 3; ++i)
		std::cout << heights[i] << std::endl;
	return 0;
}

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

using namespace std;

int main() {
	vector<int> heights;
	int meter;

	for(int index = 0; index < 10; ++index) {
		cin >> meter;
		heights.push_back(meter);
	}
	
	sort(heights.begin(), heights.end());
	
	cout << heights[9] << endl;
	cout << heights[8] << endl;
	cout << heights[7] << endl;
	
	return 0;
}

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

int main() {
	multiset<int, greater<int>> mul;
	int itr = 0; int temp;
	while (cin >> temp) { mul.insert(temp); }
	for (auto x : mul) { 
		cout << x << endl; itr++;
		if (itr == 3) break;
	}
	return 0;
}

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

int main() {
	using namespace std;
	set<int> setHom;

	for (int i = 0; i < 10; ++i) {
		int iHom;
		cin >> iHom;
		setHom.insert(iHom);
	}

	set<int>::reverse_iterator rit = setHom.rbegin();
	for (int i = 0; i < 3; ++i, ++rit) {
		cout << *rit << endl;
	}

	return 0;
}

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

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

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

int main() {
    vector<int> input;
    for (int i = 0; i < 10; i++) {
        int tmp;
        cin >> tmp;
        input.push_back(tmp);
    }
    sort(input.rbegin(), input.rend());
    for (int i = 0; i < 3; i++) {
        cout << input[i] << endl;
    }
}

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

int main ()
{
	std::vector<int> h (10);
	int a;

	while (std::cin >> a) {
		h.push_back (a);
	}
	std::sort (begin (h), end (h));
	std::vector<int>::reverse_iterator it = rbegin (h);
	std::cout << *it++ << std::endl;
	std::cout << *it++ << std::endl;
	std::cout << *it++ << std::endl;
}

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

using namespace std;

int main(void)
{
	int input[10];

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


	for(int i = 3; i < 10; i++){
		for(int j = 0; j < 3; j++){
			if(input[i] > input[j]){
				input[j] = input[i];
				break;
			}
		}
	}

	sort(input, input+3);

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


	return 0;
}

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

using namespace std;

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

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