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<stdio.h>

int main()
{
    int i,j,temp,height[15];

    for(i=0;i<10;i++)
    {
        scanf("%d",&height[i]);
    }
    for(i=0;i<10;i++)
    {
        for(j=i+1;j<10;j++)
        {
            if(height[i]>height[j])
            {
                temp=height[j];
                height[j]=height[i];
                height[i]=temp;
            }
        }
    }
    for(i=9;i>6;i--)
    {
        printf("\n%d",height[i]);
    }
    return 0;
}

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

int main()
{
	std::array<int,10> mh;
	for (int &el : mh){
		std::cin >> el;
	}
	std::sort(mh.begin(), mh.end());

	std::cout << mh.back() << std::endl;
	std::cout << mh.back() - 1 << std::endl;
	std::cout << mh.back() - 2 << std::endl;

}

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

int main(void) {
    priority_queue<int> que;
    
    
    int num;
    while(scanf("%d", &num) != EOF) {
        que.push(num);
    }
    cout << que.top() << endl; que.pop();
    cout << que.top() << endl; que.pop();
    cout << que.top() << endl; que.pop();
    
    return(0);
}

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

int main() {
	int h[10],max;
	for (int i = 0; i < 10; i++)
		cin >> h[i];
	
	for (int lp = 0; lp < 3; lp++) {
		max = -1;
		for (int lp2 = 0; lp2 < 10; lp2++) {
			if (max == -1)
				max = lp2;
			else if (h[max] < h[lp2])
				max = lp2;
		}
		cout << h[max]<<endl;
		h[max] = -1;
	}
	return 0;
}

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

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

C++: 
#include<stdio.h>
int main()

{
    int i, j, n;
    int count=0;
    scanf("%d", &n);
    if(n>1)
    {

        for(j=1; j< n; j++)
    {


        for(i=2;i< j; i++)
            {
                if(j%i==0 && n%i==0)
                break;


            }
        if(j%i==0 && n%i==0)
        count++;
    }
    printf("%d", n-1-count);
    }
    else if(n==1)
    printf("1");

    return 0;
}

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

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int ans[10];
    for(int i=0;i<10;i++) cin >> ans[i];
    sort(ans, ans+10);
    for(int i=9;i>=7;i--) cout << ans[i] << "\n";
    return 0 ;
}

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

C++: #include<algorithm>a[10],imain(){    for(;i<10;scanf("%d",a+i++)); sort(a,a+10);for(;i>7;printf("%d\n",a+(--i)));return 0;}

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

int main(){
	
	int height[10] = {};

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

	int f = 0, s = 0, t = 0;

	for (int i = 0; i < 9; i++){
		if (height[i] > t){
			t = height[i];
		}
		if (t > s){
			swap(s, t);
		}
		if (s > f){
		swap(f,s);
		}
	}
    
	cout << f<< "\n" << s << "\n" << t << endl;
		return 0;
}

C++: #include<iostream>
#include<vector>
#include<cstdio>
#include<string>
#include<algorithm>
#include<numeric>
#include<vector>
#include<iostream>
#include<map>

using namespace::std;

int main(void)
{

  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[i] << endl;
    }

  return 0;
}

C++: #include <stdio.h>
#include <functional>
int main(){
  int mt[10], i;
  std::sort(mt, mt + 10, std::greater<int>);
  for (i = 0; i < 3; i++) printf("%d", mt[i]);return 0;
}

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

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

int i,j,a[12];

int comp(const void *p,const void *q){
	return *(int *)q-*(int *)p;
}

int main(){
	scanf("%d",&a[0]);
	for(i=0;i<10;i++)scanf("\n%d",&a[i]);
	
	qsort(a,10,sizeof(int),comp);
	
	printf("%d\n",a[0]);
	printf("%d\n",a[1]);
	printf("%d",a[2]);
	
	return 0;
}

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

C++: #include <stdio.h>

int main()
{
  int first = 0;
  int second = 0;
  int third = 0;
  int high, i;

  for(i = 0;i < 10;i++){
    scanf("%d", &high);
    
    if(high > first){
      third = second;
      second = first;
      first = high;
    }else if(high > second){
      third = second;
      second = high;
    }else if(high > third){
      third = high;
    }
  }
  printf("%d\n", first);
  printf("%d\n", second);
  printf("%d\n", third);
 
}

C++: #include<algorithm>a[10],i;main(){    for(;i<10;scanf("%d",a+i++)); sort(a,a+10);for(;i>7;printf("%d\n",a+--i));return 0;}

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

using namespace std;

int main(void) {
	int height[10];
	priority_queue<int,vector<int> > que;
	
	for(int i=0;i<10;i++){
		scanf("%d",&height[i]);
		que.push(height[i]);
	}
	for(int i=0; i<3; i++){
		printf("%d\n",que.top());
		que.pop();
	}
	
	return 0;
}

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

using namespace std;

int main(void){
  int i,array[10];

  for(i=0;i<10;i++)  scanf("%d",&array[i]);
  sort(array,array+10);
  for(i=0;i<3;i++)  printf("%d\n",array[i]);

  return 0;
}

C++: #include<iostream>
using namespace std;
int main(void)
{
  int a[10]={};
  int i=0;
  int j=0;

  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<iostream>
using namespace std;
int main(){
  int a;
  int x=0;
  int y=0;
  int z=0;
  for(int i=1;i<=10;i++){
    cin >> a;
    if(a>x){
      x=a;
    }else if(y<a && a<=x){
      y=a;
    }else if(z<a && a<=y){
      z=a;
    }
  }
  cout << x << endl;
  cout << y << endl;
  cout << z << endl;
}

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

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

C++: #include <iostream>
using namespace std;
  
int main()
{
    int array[10];
    int i,j;
    for(i=0; i<10; i++)
        cin>>array[i];
    
    for(i=0; i<9; i++){
        for(j=i+1; j<10; j++){
            if(array[i]<array[j]){
                int tmp=array[i];
                array[i]=array[j];
                array[j]=tmp;
            }
        }
    }
    
    for(i=0; i<3; i++)
        cout<<array[i]<<"\n";
    
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	int i,h[10];
	for(i=0;i<10;i++){
		scanf("%d",&h[i]);
	}
	printf("%d",fir(h));
	printf("%d",sec(h));
	printf("%d",thi(h));
	return 0;
}

int fir(const int *h){
	int i,f=0;
	for(i=0;i<10;i++){
		f<h[i] ? f=h[i] : /*処理無し*/;
	}
	return f;
}

int sec(const int *h){
	int i,f,s;
	for(i=0;i<10;i++){
		f<h[i] ? f=h[i] : /*処理無し*/;
	}
	for(i=0;i<10;i++){
		f>=h[i] && s<h[i] ? s=h[i] : /*処理無し*/;
	}
	return s;
}

int thi(const int *h){
	int i,f,s,t;
	for(i=0;i<10;i++){
		f<h[i] ? f=h[i] : /*処理無し*/;
	}
	for(i=0;i<10;i++){
		f>=h[i] && s<h[i] ? s=h[i] : /*処理無し*/;
	}
	for(i=0;i<10;i++){
		s>=h[i] && t<h[i] ? t=h[i] : /*処理無し*/;
	}
	return t;
}