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<bits/stdc++.h>
using namespace std;

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

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int i,s,j,a[10];
    for(i=0;i<10;i++)
    {
        cin>>a[i];
    }
    for(i=0;i<10;i++)
    {
        for(j=i+1;j<10;j++){
            if(a[i]<a[j])
            {
                s=a[j];
                a[j]=a[i];a[i]=s;
            }
        }
    }
    for(i=0;i<3;i++){
        cout<<a[i]<<endl;
    }
}

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

int main()
{
	int input;
	int top[3]={0,0,0};
	for(int i=0;i<10;i++){
		cin>>input;
		for(int j=0;j<3;j++){
			if (input>top[j]){
				top[j]=input;
				break;
			}
		}
	}
	for(int j=0;j<3;j++){
		cout << top[j] << "\n";
	}
}

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

int main() {
	int i, j, a[10] = {0}, temp;
	for (i = 0; i < 10; i++) {
		cin >> a[i];
	}
	for (i = 0; i < 10; i++) {
		for(j = 0; j < 10; j++) {
			if (a[j] < a[i]) {
				temp = a[j];
				a[j] = a[i];
				a[i] = a[j];
			}
		}
	}
	for (i = 9; i > 6; i--) {
		cout << a[i] << endl;
	}
	return 0;
}

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

int main(){

int h[10];

for(int i=0;i<10;i++)
	scanf("%d",&h[i]);

sort(h,h+10);

printf("%d\n%d\n%d\n",h[9],h[8],h[7]);

return 0;		
}

C++: #include<stdio.h>
int main(void)
{
	int a, b, max = 0, max2 = 0, max3 = 0;
	for (a = 1; a <= 10; a++) {
		scanf("%d", &b);
		if (b > max) {
			max = b;
		}
		else if (b > max2) {
			max2 = b;
		}
		else if (b > max3) {
			max3 = b;
		}
	}
	printf("%d\n %d\n %d\n", max, max2, max3);
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
    int x[10],i;
    for(i=0;0<=i && i<10;++i){
        cin>>x[i];
           }
    sort(x);
    cout<<x[0]<<endl;
    cout<<x[1]<<endl;
    cout<<x[2]<<endl;
    return 0;
}

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

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);
  for (int i = 9; i >= 7; i--) {
    cout << h[i] << endl;
  }
  return 0;
}

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

int main(){

	int h[9];
	int i,j;
	int temp;

	h[0]=1819;
	h[1]=2003;
	h[2]=876;
	h[3]=2840;
	h[4]=1723;
	h[5]=1673;
	h[6]=3776;
	h[7]=2848;
	h[8]=1592;
	h[9]=922;

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

			if(h[i]>h[j]){
			temp=h[i];
			h[i]=h[j];
			h[j]=temp;
		
			}
		}
	}
	
	cout << "最も高い山は :" << h[0] << endl;

	cout << "２番目に高い山は :" << h[1] << endl;

	cout << "３番目に高い山は :" << h[2] <<endl;


	return 0;


}

C++: #include <iostream>

using namespace std;

int main(){
  int heights[10];
  for(int i=0; i<10; i++){
    cin >> heights[i];
    cout << heights[i] << endl;
  }
  return 0;
}

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

int main()
{
	int i,j;

	 for (i=1; i<=9; i++)
	 {
			for (j=1; j<=9; j++)
			{
				cout <<i<<"x"<< j <<"="<< i*j <<endl;
				break;
			}
		
	 }

	 return 0;
	 

	 }

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)
using namespace std;
int main()
{
    vector<int>v;
    int a;
    for(int i=1;i<=10;i++)
    {
        cin>>a;
        v.push_back(a);

    }
    sort(v.begin(),v.end());
    cout<<v[9]<<endl<<v[8]<<endl<<v[7];
    return 0;
}

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

int main()
{
    int a[10], m1, m2, m3;
    for(int i = 0; i < 10; i++) cin >> a[i];
    m1 = a[0]; m2 = a[1]; m3 = a[2];
    if(m1 < m2) swap(m1, m2);
    if(m1 < m3) swap(m1, m3);
    if(m2 < m3) swap(m2, m3);
    for(int i = 3; i < 10; i++){
        if(a[i] > m1) m3 = m2, m2 = m1, m1 = a[i];
        else if(a[i] > m2) m3 = m2, m2 = a[i];
        else if(a[i] > m3) m3 = a[i];
    }
    cout << m1 <<'\n'<<m2<<'\n'<<m3<<'\n';
    return 0;
}

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

template<typename T>
int array_max(T array[],int n)
{
	int max;
	max=0;
	for(int i=1;i<n;i++)
	{
		if(array[i]>array[max]) max=i;
		
	}
	return max;
}

int main(){
	int mount[10];
	for(int i=0;i<10;i++){
		cin >> mount[i];
	}
	for(int i=0;i<3;i++)
	{
		int max=array_max(mount,10-i);
		cout << mount[max] << endl;
		swap(mount[max],mount[9-i]);
	}
   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[7] << endl << a[8] << endl << a[9] << endl;

return 0;
}

C++: #define D(x) cout << #x " = " << x << endl
#define DD(x, y) cout << "(" #x ", " #y ") = (" << x << ", " << y << ")" << endl
#define DDD(x, y, z) cout << "(" #x ", " #y ", " #z ") = (" << x << ", " << y << ", " << z << ")" << endl
#define DV(v) for (auto __macro_vi : v){ cout << __macro_vi << " ";} cout << endl;
#define DA(a, n) for (int __macro_i = 0; __macro_i < n; ++__macro_i) { cout << a[__macro_i] << " "; } cout << endl;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) (v).begin(), (v).end()
#include<iostream>
#include<vector>
#include<cassert>
#include<cmath>
#include<algorithm>
using namespace std;

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

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

int main(){

int h[10];
int rank[10];

for(int i=0;i<10;i++){
	scanf("%d",&h[i]);
}

for(int i=0;i<10;i++){
	int label=0;
	for(int j=0;j<10;j++){
		if(h[i]<h[j])
			label+=1;
	}
	rank[label]=h[i];
}

printf("%d\n%d\n%d\n",rank[0],rank[1],rank[2]);

return 0;		
}

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

using namespace std;

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

	sort(h, h + 10);
	reverse(h, h + 10);
	cout << h[0] << endl << h[1] << endl << h[2] << endl;
}

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

int main(){
	priority_queue<int> que;
	int a;
	for(int i=1;i<=10;i++){
		cin>>a;
		que.push(a);
	}
	for(int i=1;i<=3;i++){
		cout<<que.top()<<endl;
		que.pop();
	}
	return 0;
}