Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)

	s := make([]int, 10)
	for i := 0; i < 10; i++ {
		s[i], _ = strconv.Atoi(read())
	}
	sort.Sort(sort.Reverse(sort.IntSlice(s)))
	fmt.Println(s[0])
	fmt.Println(s[1])
	fmt.Println(s[2])
}

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

int main()
{
    array<int, 10> mount;
    for (int i = 0; i < 10; i++){
        cin >> mount.at(i);
    }
    for (int j = 9; j != 6; j--){
        for (int i = 0; i < j; i++){
            if (mount.at(i) > mount.at(i+1)){
                int spare = mount.at(i);
                mount.at(i) = mount.at(i+1);
                mount.at(i+1) = spare;
            }
        }
    cout << mount.at(j) << endl;
    }
}

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

int main(){
  int h[10];
  for(int i=0;i<10;i++){
    cin>>h[i];
  }
  for(int j=0;j<10;j++){
    for(int k=0;k<9 -j;k++){
      if(h[k]<h[k+1]){
	int a=h[k],b=h[k+1];
	h[k]=b;
	h[k+1]=a;
      }
    }
  }
  for(int l=0;l<3;l++){
    cout<<h[l]<<endl;
  }
	
	
      
  
    return 0;
}

C++: #include <iostream> 
#include<cmath>
#include<iomanip>
using namespace std;  
int main()  
{  
    int x[10];
    int alter;
    int flag = 1;
    for(int i =0;i < 10;i++)
    {
    	cin>>x[i];
    	if(x[i] < 0 || x[i] > 10000)
		  break;	
	}
	while(flag == 1)
	{
		flag = 0;
		for(int i =0;i < 10;i++)
		{
			if(x[i - 1] > x[i])
			{
				alter = x[i];
				x[i] = x[i - 1];
				x[i - 1] = alter;
				flag = 1;
			}
		}
	}
	cout<<x[9]<<endl;
	cout<<x[8]<<endl;
	cout<<x[7]<<endl;
	return 0;
}

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

int main(void)
{
	unsigned h[10];
	int c = 0;

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

	do{
		int i = c;
		c = 10;
		for(int j = 9; j > i; j--) {
			if(h[j] > h[j - 1]) {
				unsigned tmp = h[j];
				h[j] = h[j - 1];
				h[j - 1] = tmp;
				c = j - 1;
			}
		}
	}while(c < 10);

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

	return 0;
}

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

int main () {
    int f;
    f = 0;
    int s;
    s = 0;
    int t;
    t = 0;
    for (int i=0;i<10;++i){
        int a;
        cin >> a;
        if (a > t){
            t = a;
        }
        if (t > s) {
            int tmp;
            tmp = s;
            s = t;
            t = tmp;
        }
        if (s > f){
            int tmpo;
            tmpo = f;
            f = s;
            s = tmpo;
        }
    }
    cout << f << endl;
    cout << s << endl;
    cout << t << endl;
    return 0;
}

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

using namespace std;

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

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

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

C++: #include <iostream>
#include <queue>
using namespace std;
main(){
	int c;
	priority_queue<int>  pq;

	for (int i=0;i<10;i++){
		cin >> c;
		pq.push(c);
	}
	for (int i=0;i<3;i++){
		cout << pq.top() << endl;
		pq.pop();

	}

}

C++: #include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
      
int main(void){
    /* 宣言と初期化 */
    int hai[10];
    int id[2];
    int i;
    int temp2nd;
    int temp3rd;
    int tempmax;
               
for(i=0;i<10;i++)
{
   cin >> hai[i];
}
    /* 代入 */
    temp2nd=hai[0];
    tempmax=hai[0];
    temp3rd=hai[0];
    /* 計算 */
for(int j=9;j>1;j--){
    for(i=0;i<j;i++){
        /* 最大値求める */
        if(hai[j]<hai[i])
       {tempmax=hai[i];
         hai[i]=hai[j];
         hai[j]=tempmax;
        }
    }
    }
 
    /* 表示 */
    printf("%d\n",hai[9]);
    printf("%d\n",hai[8]);
    printf("%d\n",hai[7]);
               
    return 0;
}

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

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

C++: #include<stdio.h>
const int N = 15;
int main()
{
	int a[N] = {0};
	for(int i = 0; i < 10; i++)
	{
		scanf("%d", &a[i]);
	}
	for(int i = 0; i < 10; i++)
	{
		for(int j = i; j < 10; j++)
		{
			if (a[i] < a[j])
			{
				int tmp = a[i];
				a[i] = a[j];
				a[j] = tmp;
			}
		}
	}
	for(int i = 0;i < 3;i++)
	{
		printf("%d\n", a[i]);
	}
	return 0;
}

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

template<class T>
T input()
{
	T val;
	std::cin >> val;
	return val;
}

int main()
{
	std::array<int, 10> high;
	for (int i = 0; i < 10; ++i)
		high[i] = input<int>();

	std::sort(high.begin(), high.end());

	std::cout << high[9] << " " << high[8] << " " << high[7] << std::endl;
}

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

using namespace std;

void Top3Mountains(int m1,int m2,int m3,int m4,int m5,int m6,int m7,int m8,int m9, int m10)
{
			deque<int> mountains;
			if ( m1 >= 0 && m1 <= 10000 )mountains.push_back(m1);
			if ( m2 >= 0 && m2 <= 10000 )mountains.push_back(m2);
			if ( m3 >= 0 && m3 <= 10000 )mountains.push_back(m3);
			if ( m4 >= 0 && m4 <= 10000 )mountains.push_back(m4);
			if ( m5 >= 0 && m5 <= 10000 )mountains.push_back(m5);
			if ( m6 >= 0 && m6 <= 10000 )mountains.push_back(m6);
			if ( m7 >= 0 && m7 <= 10000 )mountains.push_back(m7);
			if ( m8 >= 0 && m8 <= 10000 )mountains.push_back(m8);
			if ( m9 >= 0 && m9 <= 10000 )mountains.push_back(m9);
			if ( m10 >= 0 && 10 <= 10000 )mountains.push_back(m10);

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

			deque<int>::iterator it = mountains.begin();

			int i=0;
			for(i=0;i<3; i++){
				cout << *it << endl;
				it++;
			}
	
}

int main()
{

	Top3Mountains(1819,2003,876,2840,1723,1673,3776,2848,1592,922);
	return 0;
}

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

void BSort(int a[],int n);

int main () {

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

void BSort(int a[],int n){
	int temp;
	for(int i=0;i<n-1;i++){
		for(int j=n-1;j>i;j--){
			if(a[j-1]>a[j]){
				temp=a[j];
				a[j]=a[j-1];
				a[j-1]=temp;
			}
		}
	}
}

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    vector<int> v;
    int n;
    for(int i=0; i<10; i++) {
        cin >> n;
        v.push_back(n);
    }
    sort(v.begin(), v.end());
    cout << v[9] << endl;
    cout << v[8] << endl;
    cout << v[7] << 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(h.begin(),h.end());
	for(int i = 0 ; i < 3 ; i++)
		cout << h[9-i] << endl;
}

C++: #include <iostream>
using namespace std;
int main(){
int a[] = {1819
,2003
,876
,2840
,1723
,1673
,3776
,2848
,1592
,922};
int ma=0, aa = 0;

for(int j=0;j<3;j++){
for(int i=0;i<10;i++){
if(ma > a[i])
ma = a[i];
aa = i;
}
cout << ma << endl;
a[a] = 0;
}

return 0;
}

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

int main()
{
	int mountains[10];
	int first = 0,second = 0,third = 0;

	for(int i=0;i<10;i++) {
		cin >> mountains[i];
		if(mountains[i]>first) {
			third = second;
			second = first;
			first = mountains[i];
		}
		else if(mountains[i]>second) {
			third = second;
			second = mountains[i];
		}
		else if(mountains[i]>third)
			third = mountains[i];
	}

	cout << first << endl << second << endl << third << endl;

	return 0;
}