Go: package main

import "fmt"

func main() {
	var height int
	topHeights := [5]int{}

	for i := 0; i < 10; i++ {
		fmt.Scan(&height)

		for j := 0; j < 3; j++ {
			if topHeights[j] < height {
				topHeights[j+2] = topHeights[j+1]
				topHeights[j+1] = topHeights[j]
				topHeights[j] = height
				break
			}
		}
	}

	for i := 0; i < 3; i++ {
		fmt.Println(topHeights[i])
	}
}

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

	
	for (int j=0;j<=9;j++){
			while(cin >> data){
			if (data<=10000 && data >= 0 ) {
			m[j]=data;
			break;
		}
			}
	}

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

	if (m[i] < m[i+1]){
		swap(m[i],m[i+1]);
	for (int j=i;j>0;j--){
	if (m[j] > m[j-1])
		swap(m[j],m[j-1]);
	}
	}
}


 
for (int i=0;i<=2;i++){
cout <<  m[i] <<'\n';
}

    return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int height[10];
	for (int i=0; i<10; i++) { cin >> height[i]; }
	
	int top[3] ={0};
	for (int i=0; i<10; i++) {
		for (int j=0; j<3; j++) {
			if (height[i] > top[j]) {
				for (int k=2; k>j; k--) { top[k] = top[k-1]; }
				top[j] = height[i];
			}
		}
	}
	
	for (int j=0; j<3; j++) { cout << top[j] << endl; }
	
	return 0;
}

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

int cmpint(const void *a, const void *b){
	return (*(int*)b - *(int*)a);
}

int main(void){
	int h[10];
	for(int i=0;i<10;++i){
		scanf("%d", h+i);
	}
	qsort(h, 10, sizeof(int), cmpint);
	for(int i=0; i<3;++i){
		printf("%d\n", h[i]);
	}

	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int a[15];
int main(){
	for(int i=0;i<10;i++)
		scanf("%d",a+i);
	sort(a,a+10);
	printf("%d\n%d\n%d\n",a[9],a[8],a[7]);
	return 0;
}

C++: include <iostream>

int main(){
	int first=0,second=0,third=0,height;
	for(int i=0;i<10;++i){
		height=get();
		if(height>first){
			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>
using namespace std;
int main()
{
	int a,mountain[10],j,k;
	for(int i=0;i<10;i++){
		cin>>moutain[i];
	}
	for(j=0;j<10;j++){
		for(k=0;k<10-j;k++){
			if(mountain[k]<mountain[k+1]){
				a=mountain[k];
				mountain[k]=montain[k+1];
				mountain[k+1]=a;
			}
		}
	}
	cout<<mountain[0]<<"\n"<<moutnain[1]<<"\n"<<mountain[2]<<"\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());
auto p=std::unique(h.begin(),h.end());
std::cout<<p++<<std::endl;
std::cout<<p++<<std::endl;std::cout<<p<<std::endl;

 
return 0;
}

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

using namespace std;

int main () {
  vector<int> v;
  for (int i = 0; i < 10; i++) {
    int t;
    scanf("%d", &t);
    v.push_back(t);
  }
  sort(v.begin(), v.end());
  for (int i = 0; i < 3; i++) {
    printf("%d\n", v[9 - i]);
  }
}

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

int main(){
	int nya[9];
	int hoge;
	for (int j=0;j<10;j++) {
		cin >> nya[j];
	}
	for (int i=0;i<20;i++){
		for (int k=1;k<10;k++){
		if (nya[k] > nya[k-1]) {
			hoge = nya[k-1];
			nya[k-1] = nya[k];
			nya[k] = hoge;
		}
		}
	}
	cout << nya[0] << endl << nya[1] << endl << nya[2] << endl;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>
#define REP(i,m,n) for(int i=m;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
typedef pair<int,int> pii;

inline bool IN(int x, int y, int w, int h)
{
    return 0 <= x && x < w && 0 <= y && y < h;
}


int main()
{

	vi l;
	rep(i,10){
		int tmp;
		cin >> tmp;
		l.pb(tmp);
	}
	sort(l.begin(),l.end(),greater<int>());
	cout << l[0] << endl;
	cout << l[1] << endl;
	cout << l[2] << endl;

	return 0;
}

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

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

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

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

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

C++: #include <iostream>

int main() {
  int x;
  int rank1 = 0;
  int rank2 = 0;
  int rank3 = 0;
  for (int i = 0; i < 10; i++) {
    std::cin >> x;
    if (x > rank1) {
      rank3 = rank2;
      rank2 = rank1;
      rank1 = x;
    } else if (x > rank2) {
      rank3 = rank2;
      rank2 = x;
    } else if (x > rank3) {
      rank3 = x;
    }
  }
  std::cout << rank1 << ' ' <<  rank2 << ' ' << rank3 << std::endl;
  return 0;
}

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

namespace
{
	std::vector<unsigned int> altitude(10);
}

int main()
{
	for (unsigned int i = 0; i < 10; i++)
	{
		std::scanf("%u", &altitude[i]);
	}
	std::sort(altitude.begin(), altitude.end(), std::greater<unsigned int>());
	for (unsigned int i = 0; i < 3; i++)
	{
		std::printf("%u\n", altitude[i]);
	}
}

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

int main() {
	int X[10];
	for (int i = 0; i < 10; i++) {
		cin >> X[i];
	}
	sort(X, X + 10, greater<int>());
	for (int i = 0; i < 3; i++) {
		cout << X[i] << 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()
{
	string str = "";
	int n;
	vector <int> hight;

	while (getline (cin, str )){
		stringstream ssn(str);
		ssn >> n;
		hight.push_back(n);
	} // end while

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

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

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

	return 0;
}