Go: // 九九を出すだけ
package main
import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"sort"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main(){
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	mountains := make([]int, 10)
	for i:=0; i<10; i++{
		mountains[i]=nextInt()
	}
	sort.Ints(mountains)
	for _, v := range mountains[7:]{
		fmt.Fprintln(out, v)
	}
}

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

func nextInt() int{
	a, _ := strconv.Atoi(next())
	return a
}

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);
	reverse(a, a+10);
	cout << a[0] << endl << a[1] << endl << a[2] << endl;
}

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

int main() {

  int input;
  vector<int> yama;

  for ( int i = 0; i < 10; i++ ) {
    cin >> input;
    yama.push_back(input);
  }

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

  cout << yama[0] << endl << yama[1] << endl << yama[2] << endl;

  return 0;

}

C++: #include <iostream>
#include <algorithm>
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]<<'\n'<<h[8]<<'\n'<<h[7]<<'\n';
    return 0;
}

C++: #include<stdio.h>

int main(){
	int i;
	int c=0,a[3]={0,0,0};
	for(i=0;i<10;i++){
		scanf("%d",&c);
		if(c>a[0]){
			a[2]=a[1];
			a[1]=a[0];
			a[0]=c;
		}else if(c>a[1]){
			a[2]=a[1];
			a[1]=c;
		}else if(c>a[2]){
			a[2]=c;
		}
	}

	for(i=0;i<3;i++)printf("%d\n",a[i]);
	return 0;
}

C++: #include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
#define _USE_MATH_DEFINES
#include<math.h>
#include<queue>
#include<set>
#include<vector>
#define INF 100000000

#define MAX_N 100

typedef long long int ll;
using namespace std;


int main(){

	int mountain[10];

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

	for(int i = 0; i < 10; i++){
		for(int j = i+1; j < 10; j++){
			if(mountain[i] < mountain[j]){
				int kari = mountain[i];
				mountain[i] = mountain[j];
				mountain[j] = kari;
			}
		}
	}

	for(int i = 0; i < 3; i++){
		printf("%d\n", mountain[i]);
	}

	return 0;

}

C++: #include<iostream>
using namespace std;
int main()
{
    int m1,m2,m3;
    m1=m2=m3=0;
    for(int i=0;i<10;i++)
    {
        int h;
        cin>>h;
        if(h>m1)m3=m2,m2=m1,m1=h;
        else if(h>m2)m3=m2,m2=h;
        else if(h>m3)m3=h;
        else;
    }
    cout<<m1<<endl<<m2<<endl<<m3<<endl;
    return 0;
}

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

int main(){
	int h[10];

	for (int i = 0; i < 10; i++){
		cin >> h[i];
	}
	for (int i = 0; i < 9; i++){
		for(int j = i + 1; j < 10; j++){
			if(h[i] < h[j]){
				int temp = h[i];
				h[i] = h[j];
				h[j] = temp;
			}	
		}
	}
	for(int i = 0; i < 3; i++){
		cout << h[i] << endl;
	}

}

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

C++: #include<iostream>
using namespace std;
int main(){
  int m[10];
  int ans = 0;
  for(int i=0;i<10;i++){
    cin >> m[i];
  }
  for(int i=0;i<3;i++){
    for(int f=0;f<10;f++){
      if(ans == m[f]){
	m[f] = 0;
      } 
      for(int j=0;j<10;j++){
    if(ans<m[j]){
      ans = m[j];
    }   
      }
    }
    cout << ans <<endl;  
    ans = 0;
  }
  return 0;
}

C++: #include<stdio.h>
int main(){
	int list[10];
	int lank[3]={-1},chk[3]={11},f=0,ch=11;
	for(int i=0;i<10;i++){
		scanf("%d",&list[i]);
	}
	for(int c=0;c<3;c++){
		for(int i=0;i<10;i++){
			for(int j=0;j<3;j++){
				if(chk[j]==i){
					f=1;
				}
			}
			if(f==1){
				f=0;
			}else{
				if(lank[c]<=list[i]){
					lank[c]=list[i];
					ch=i;
				}
			}
		}
		chk[c]=ch;
	}
	for(int c=0;c<3;c++){
		printf("%d\n",lank[c]);
	}
	return 0;
}

C++: #include <stdio.h>
int main(){
 int a,b,c,d,a_max,N[10];

   for(a=0;a<10;a++){ 
   scanf("%d",&N[a]);
       }

     for(b=0;b<10;b++){ 
        b=a_max;
           for(c=b;c<10;c++){ 
              if(a_max<c){c=a_max;
                    }  
                  d=c; c=a_max; a_max=d; 
                       }

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

return 0;
}

C++: //
//  main.cpp
//  kyougi
//
//  Created by 寺林 一旭 on 2018/08/27.
//  Copyright © 2018年 寺林 一旭. All rights reserved.
//

#include <iostream>
int main(int argc, const char * argv[]) {
 
    int n = 0;
    while(std::cin >> n)
    {
    std::string str;
    getline(std::cin, str);
    std::cin.ignore();
        std::cout << str << std::endl;
    }
    
    
    
    return 0;
}

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

using namespace std;

int main()
{
    priority_queue<int> qu;
    int n;
    for( int i = 0; i < 10; i++){
        cin >> n;
        qu.push(n);
    }

    for( int i =0; i < 3; i++){
        cout << qu.top()<< endl;
        qu.pop();
    }

    return 0;
}

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

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

using namespace std;

int main()
{
    int i, a, b, c, height[12];

    for(i=1; i<=10; i++)
        cin>>height[i];

    sort(height+1, height+11);

    for(i=10; i>=8; i--)
        cout<<height[i]<<endl;

    return 0;
}

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

using namespace std;
int main(){
	vector<int> mt;
	for(int i=0;i<10;i++){
		int tmp;
		cin>>tmp;
		mt.push_back(tmp);
	}
	sort(mt.begin(),mt.end());
	for(int i=9;i>=7;i--){
		cout<<mt[i]<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
int main(){
  int a[10],b=0,c=0,d[3],e=0;

  while(cin >> a[b]){
    if(b==10)break;
    b++;
  }

  sort(a,a+10);

  for(e=9;e!=6;e--){
    cout << a[e] <<endl;
  }
}

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

using namespace std;

int main(void){

  int mountain[10];

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

  sort( mountain , mountain + 10 );

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

  return 0;
}

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

#define INPUTSIZE 10

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

    sort(inputs, inputs + INPUTSIZE);

    for (int i = 1; i <= 3; i++) cout << inputs[INPUTSIZE - i] << endl;

    return 0;
}

C++: #include <iostream>

auto main() -> int {
    for (int x = 1; x <= 9; x++) {
        for (int y = 1; y <= 9; y++) {
            std::cout << x << "x" << y << "=" << (x*y) << std::endl;
        }
    }
    return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#define sf scanf
#define pf printf
using namespace std;
int main()
{
    int ar[11];
    for(int i = 0; i<=9; i++)
    {
        sf("%d", &ar[i]);
    }

    sort (ar, ar+10);
    for(int i = 9; i>=7; i--)
    {
        pf("%d\n", ar[i]);
    }

    return 0;
}

C++: #include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <ctime>
#include <iterator>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;


int main()
{
    vector<int> v(10000,-1);
    int i=0;
    int tmp;
    while(cin>>tmp)
    {
        v[i++]=tmp;
    }
    sort(v.rbegin(),v.rend());
    cout<<v[0]<<endl<<v[1]<<endl<<v[2]<<endl;
}

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

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