Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	heights := make([]int, 10)
	for i := 0; i < 10; 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 <algorithm>
#include <cstdlib>
#include <iostream>
using namespace std;

int main() {
	constexpr int MAX_N = 10;
	vector<int> height(3, 0);

	for(int i = 0; i < MAX_N; ++i) {
		int h;
		cin >> h;

		for(int j = 0; j < 3; ++j) {
			if(height[j] < h) {
				swap(height[j], h);
			}
		}
	}

	for(const auto &e : height) {
		cout << e << "\n";
	}

	return EXIT_SUCCESS;
}

C++: #include <iostream>
using namespace std;
int main(void){
    int s,w,t,y,roop,i;
    s=0;
    w=0;
    t=0;
    roop=0;
    while(1){
        roop=roop+1;
        cin>>y;
        if(y>t){
            i=3;
            if(y>w){
                i=2;
                if(y>s){
                    i=1;
                }
            }    
        }
        if(i==1){swap(y,s);}else if(i==2){swap(y,w);}else if(i==3){swap(y,t);}
        if(roop>=10){
            break;
        }
        i=0;
    }
    cout<<s<<endl;
    cout<<w<<endl;
    cout<<t<<endl;
}

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

using namespace std;

int main()
{
    int height[10];
    int n = sizeof(height)/sizeof(height[0]);
    for(int x = 1; x <= 10; x++){
        cin >> height[x];//input
        if (height[x] > 10000 || height[x] < 0){
            cin >> height[x];
        }
        else{};
    }
    cout << endl;
    sort(height, height+n,greater<int>());
    cout << height[0] << endl;
    cout << height[1] << endl;
    cout << height[2] << endl;
    return 0;
}

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

using namespace std;

int main ()
{
    int buf;
    priority_queue<int> qu;
    
    for (int i=0; i<10; i++) {
        cin >> buf;
        qu.push(buf);
    }
    
    cout << qu.top() << '\n';
    qu.pop();
    cout << qu.top() << '\n';
    qu.pop();
    cout << qu.top() << '\n';
    
    return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
int main(void){
std::vector<int> h;
int tmp;
while(std::cin>>tmp){
h.push_back(tmp);
}
std::sort(h.begin(),h.end());
std::uniq(h.begin(),h.end());
for(int i=0;i<3;i++){
std::cout<<h[i]<<std::endl;
}
 
return 0;
}

C++: #include <bits/stdc++.h>
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<<a[8]<<endl<<a[7]<<endl;
}

C++: #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)
#define MP make_pair


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(10);

  int INF = 1000000;

  vector<int> m;
  int hei;
  while(cin >> hei){
    m.push_back(hei);
  }

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

  REP(i,3)
    cout << m[i] << endl;

  return 0;
}

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

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

C++: #include<iostream>
#include<queue>
using namespace std;
int main(){
  priority_queue<int> mlist;
  int i;
  for(i=0;i<10;i++){
    int dt;
    cin>>dt;
    mlist.push(dt);
  }
  for(i=0;i<3;i++){
    cout <<mlist.top()<<endl;
    mlist.pop();
  }

  return 0;
}

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

int main()
{
  int mt[10];
  int high[3];

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

  for(int i=0;i<=2;i++)
    {
      high[i] = 0;
    }

  for(int i=0;i<=9;i++)
    {
      if(mt[i]>=high[2])
	{
	  high[2] = mt[i];
	}
      if(mt[i]>=high[1])
	{
	  high[2] = high[1];
	  high[1] = mt[i];
	}
      if(mt[i]>=high[0])
	{
	  high[2] = high[1];
	  high[1] = high[0];
	  high[0] = mt[i];
	}
    }

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

  return 0;
}

C++: #include<stdio.h>
#include<iostream>
using namespace std;
int main(){
	int a = 0,b=0,c=0,d=0;
	for (int i = 0; i < 10;i++){
		cin >> a;
		if (a>b){
			a = b;
			b = c;
			c = d;

		}

	}
	return 0;
}

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

using namespace std;


int main()
{
	int a[11],b=10;
	while (b--) {
		cin >> a[b];
	}
	sort(a, a + 11);
	cout << a[10] << endl << a[9] << endl << a[8] << endl;
	return (0);
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;

int main()
{
//	cut here before submit 
//	freopen("testcase.dat", "r", stdin);
	int n;
	vector <int> res(10, 0);
	int i;

	for (i = 0; i < 10; ++i){
		cin >> n;
		res[i] = n;
	} // end for

	sort (res.begin(), res.end(), greater<int>() );
	
	for (i = 0; i < 3; ++i){
		cout << res[i] << endl;
	} // end for
		
	return 0;
}

C++: #include<iostream>

int main(void)
{
	int i,j,max,tmp,high[10];

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

	for(i=0;i<3;i++){
		for(j=1,tmp=1,max=high[0];j<10;j++){
			if(max<high[j]){
				max=high;
				tmp=j;
			}
		}
		high[tmp]=0;
		std::cout << max << std::endl;
	}
	return 0;
}

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

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

int main() {

	unsigned int height[10];

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

	sort(height, height + 10);

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

	return 0;
}

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

int main() {

	int n[10];

	for (int i = 0; i < 10; ++i) {

		std::cin >> n[i];

	}

	std::sort(n, n + 10);

		for (int i = 9; i > 6; --i) {
			std::cout << n[i] << std::endl;
		}

}

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

int main(){
    std::set<int> s = {1819, 2003, 876, 2840, 1723, 1673, 3776, 2848, 1592, 922};
    auto itr = s.begin();
    for(int i = 0; i < 3; ++i) {
        std::cout << *itr << std::endl;
        ++itr;
    }
    return 0;
}

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

void bsort(int m[]){
  for(int i=9;i>0;i--){
    for(int j=0;j<i;j++){
      if(m[j] < m[j+1]){
	int tmp = m[j];
	m[j] = m[j+1];
	m[j+1] = tmp;
      }
    }
  }
  
}

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

  bsort(mou);
  
  cout << mou[0] << endl << mou[1] << endl << mou[2] << endl;
  
  return 0;
}

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

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int in;
    vector<int> v;
    while(cin >> in)
    {
        v.push_back(in);
    }
    sort(v.begin(), v.end(), greater<int>());
    for(auto num : v)
        cout << num << endl;
}