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.Sort(sort.Reverse(sort.IntSlice(mountains)))
	for _, v := range mountains[:3]{
		fmt.Fprintln(out, v)
	}
}

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

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

Python: import sys

a = []
for line in sys.stdin:
    a.append(int(line))

a.reverse()
print(a[len(a)-1])
print(a[len(a)-2])
print(a[len(a)-3])

Python: height_list = []

for _ in range(0, 10):
    height_list.append(int(input()))

for height in sorted(height_list)[::-1][:3]:
    print(height)

Python: a=[]
for i in range(10):
    a.append(int(input()))
a=sorted(a)[::-1]
for i in range(3):
    print(a[i])

Python: ls = []
for i in range(0,10):
    ls.append(int(input()))
ls.sort()
print(ls[7])
print(ls[8])
print(ls[9])

Python: print("\n".join(map(str,sorted([int(input())for _ in[0]*10])[:-4:-1])))

Python: num = [0 for i in range(10)]
for i in range(10):
	num[i] = int(input())
num.sort()
num.reverse()
print(num[0])
print(num[1])
print(num[2])

Python: a=[int(input()) for i in range(10)]
b=sorted(a)
print(b[9])
print(b[8])
print(b[7])

Python: mou1=mou2=mou3=0
for i in range(10):
    a=int(input())
    if a>mou1:
        mou3=mou2
        mou2=mou1
        mou1=a
    elif a>mou2:
        mou3=mou2
        mou2=a
    elif a>mou3:
        mou3=a
    else:
        pass
    
print(mou1)
print(mou2)
print(mou3)

Python: heights = []

for i in range(10):
    N = input()
    heights[i] = N
    
sort_heights = sorted(heights, reverse=True)
print(sort_heights[0])
print(sort_heights[1])
print(sort_heights[2])

Python: inp = input()
a = [input() for i in range(inp)]
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Python: inputList = []
while True:
    try:
        num = int(input())
    except EOFError:
        break
    inputList.append(num)

inputList.sort()
for x in range(len(inputList) - 1, -1, -1):
    print(inputList[x])

Python: #List of Top 3 Hills

set = []
a = 9
for i in range(10):
    n = int(input())
    set.append(n)
set.sort()
while a >= 7:
    print(set[a])
    a -= 1

Python: l = []
for i in range(10):
    l.append(int(input()))
l.sort()
for i in range(3):
    print(l[9-i])

Python: h = []
for i in range(10):
    h.append(int(input()))
h.sort(reverse=True)
print(h[0])
print(h[1])
print(h[2])

Python: height = [int(input()) for i in range(10)]
height.sort(reverse = True)
for i in range(3):
    print(height[i])

Python: a = list(map(int,input().split()))
a.sort()
for i in range(1,4):
    print(a[-i])

Python: height = [ 1819,2003,876,2840,1723,1673,3776,2848,1592,922 ]

top = height[0]

for x in height :
    if top < x:
       top = x 

height.remove(top);

second = height[0]
for x in height :
    if second < x:
       second= x 

height.remove(second);

third = height[0]
for x in height :
    if third < x:
       third = x 

print(top)
print(second)
print(third)

Python: from heapq import heappush, heappop

def heapsort(itr):
    h=[]
    [heappush(h, val) for val in itr]
    return [heappop(h) for i in range(len(h))]

def rep(s):
    return s.strip()

l=[]
lap=l.append
while True:
    try:
        lap(int(input()))
    except EOFError:
        break

l = heapsort(l)
l.reverse()

print(str(l[0])+' '+str(l[1])+' '+str(l[2]))

Python: hillheight = []
for i in range(0, 10):
	hillheight.append(int(raw_input()))

hillheight.sort()

for i in range(0, 3):
	print(hillheight[-1-i])

Python: H = sorted([int(input()) for i in range(10)], reverse=True)
for i in range(3):
  print(H[i])

Python: heights = [int(input()) for i in range(0, 10)]
heights.sort(reverse=True)
for height in heights[:3]:
    print(height)

Python: xs = [int(input()) for i in range(10)]
xs = list(reversed(sorted(xs)))[:3]
[print(x) for x in xs ]

Python: l = []
for i in range(10):
    n = int(input())
    l.append(n)
    l.sort(reverse=True)
print(l[0])
print(l[1])
print(l[2])

Python: a = [int(input()) for i in range(0,10)]
a.sort(reverse=True)
for i in range(0,3):
    print(a[i])

Python: h=[]
for i in range(10):
    h.append(int(input()))
h.sort()
print(h[9])
print(h[8])
print(h[7])

Python: high=[0 for i in range(10)]
for i in range(10):
	high[i]=int(input())
	
ans=[0 for i in range(3)]
for i in range(3):
	ans[i]=max(high)
	high.remove(ans[i])
	print(ans[i])

Python: spam = [int(input()) for i in range(0, 10)]
spam.sort()
spam.reverse()
for i in range(0,3):
    print(spam[i])

Python: mounts =[int(input()) for i in range(10)]
mounts.sort(reverse = True)
for i in range(3):
  print(mounts[i])

Python: mountains=[int(input()) for i in range(10)]
mountains=sorted(mountains)
rmountains=mountains[::-1]
for i in range(3):
    print(rmountains[i])

Python: n = 0
list = []
while n < 10:
    x = int(input())
    list.append(x)
    n += 1

list.sort()
print(list[9])
print(list[8])
print(list[7])

Python: a=[]
for i in range(10):a.append(int(input()))
a.sort()
print(a[9],a[8],a[7],sep='\n');

Python: def main():
    altitude_lis = []
    for i in range(10):
        input_line = raw_input()
        altitude = int(input_line)
        altitude_lis.append(altitude)
        
    altitude_lis.sort()
    altitude_lis.reverse()
    for i in range(3):
        print(altitude_lis[i])
        
if __name__ == '__main__':
    main()

Python: x = []
for i in range(10):
    x.append(int(input()))

x.sort()
x.reverse()
for i in range(3):
    print(x[i])

Python: mt = [int(input()) for i in range(10)]

mt.sort()
mt.reverse()

for i in range(3):
    print(mt[i])

Python: x = int(input().rstrip())

Python: # -*- coding: utf-8 -*-

import sys
import six

def top_k_sort(data, k=3, reverse=True):
    data.sort(reverse=True)
    return data[:k]

def main():
    data = map(int, raw_input().split())

    data = [int(v) for v in argv[1:]]
    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

Python: a = []
for i in range(10) :
  a.append(int(input()))

a.sort()
a.reverse()
print("%d\n%d\n%d" % (a[0], a[1], a[2]))

Python: LIST = []
for i in range(10) :
    LIST.append(int(input()))
LIST.sort(reverse = True)
print(LIST[0])
print(LIST[1])
print(LIST[2])

Python: height = [ 1819,2003,876,2840,1723,1673,3776,2848,1592,922 ]

top = height[0]

for x in height :
    if top < x:
       top = x 

height.remove(top);

second = height[0]
for x in height :
    if second < x:
       second= x 

height.remove(second);

third = height[0]
for x in height :
    if third < x:
       third = x 

print(top)
print(second)
print(third)

Python: l=[]
for i in range(10):
    x=int(input())
    l.append(x)
l1=sorted(l,reverse=True)

print(l1[0])
print(l1[1])
print(l1[2])

Python: a = []
for i in range(10):
    a.append(int(input()))

for i in range(3):
    maximum = 0
    index = i
    for j in range(i, 10):
        if a[j] > maximum:
            maximum = a[j]
            index = j
    temp = a[i]
    a[i] = a[index]
    a[index] = temp
    print(maximum)

Python: def main():
    a = []
    for i in range(10):
        a.append(int(input()))

    a.sort()
    a.reverse()

    for i in range(3):
        print(a[i])

if __name__ == '__main__':
    main()

Python: "\n".join([str(x) for x in (sorted([input() for i in range(10)])[:-3:-1])])

Python: import numpy as np
from numpy.random import *

def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]

        greater = [i for i in array[1:] if i > pivot]

        return quicksort(less) + [pivot] + quicksort(greater)


array = randint(1, 1000, 10) 
sorted_array = quicksort(array)
print(sorted_array[2])
print(sorted_array[1])
print(sorted_array[0])