Go: package main

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

func main() {
        fp := os.Stdin
        scanner := bufio.NewScanner(fp)
        var lst [3]int

        for scanner.Scan() {
                num, _ := strconv.Atoi(scanner.Text())
                if lst[0] < num {
                        lst[2] = lst[1]
                        lst[1] = lst[0]
                        lst[0] = num
                } else if lst[1] < num {
                        lst[2] = lst[1]
                        lst[1] = num
                } else if lst[2] < num {
                        lst[2] = num
                }
        }

        for _, i := range lst {
                fmt.Printf("%d\n", i)
        }
}

Python: def __main():

    mountains = []
    numOfMoun = 10
 
    for c in range(numOfMoun):
        mountains.insert(c,int(input('Height of the mountain ')))
        
    sorted_mounts = sorted(mountains,reverse=True)
    for k in range(3):
        print(sorted_mounts[k])
    

__main()

Python: a=[print(I) for I in sorted([int(input()) for i in range(10)])[:-4:-1]]

Python: 

import sys
a=[]
for i in sys.stdin:
    a.append(int(i))
    
x=sorted(a,reverse=True)
print(x[0])
print(x[1])
print(x[2])

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

Python: def minput():
    try:
        while True:
            data=raw_input()
            if not data: break
            yield data
    except KeyboardInterrupt:
        return
sorted(list(minput()),reverse=True)[:3]

Python: # Python 3+
#-------------------------------------------------------------------------------
import sys

#ff = open("test.txt", "r")
ff = sys.stdin

arr = [ int(x) for x in ff.readlines() ]

arr.sort(reverse=True)

for x in arr[0:3] : print(x)

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

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

first = 0
second = 0
third = 0
i = 0

for i in range(0,9):
    line = int(input())
    
    if first < int(line):
        third = second
        second = first
        first = int(line)
    elif second < int(line):
        third = second
        second = int(line)
    elif third < int(line):
        third = int(line)

print(first)
print(second)
print(third)

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

sorted(list)
h1 = a[9]
h2 = a[8]
h3 = a[7]

print(h1)
print(h2)
print(h3)

Python: l = []

for i in range(10):
    l.append(int(input()))

l.sort()

for i in range(3):
    print(l[-1 * (i+1)])

Python: #! /usr/bin/env python
# -*- coding: utf-8 -*-

def main():
	mountains = []
	for i in range(3):
		mountains.append(int(input()))
	
	mountains = sorted(mountains, reverse = True)

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


if __name__ == '__main__':
    main()

Python: [print(i) for i in (sorted([int(input()) for _ in range(10)])[:6:-1])]

Python: s = [int(input()) for i in range(10)]
for i in sorted(s)[:-4:-1]:
    print(i)

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

import sys

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

def main():
    argv = sys.argv
    argc = len(argv)

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

if __name__ == '__main__':
    main()

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

Python: Array = []

for i in range(10):
    Array.append(int(input()))

Anum = len(Array)
for i in range(Anum-1,Anum-4,-1):
    print(Array[i])

Python: lis=[];

for i in range(10):
    h=int(input());
    lis.append(h);
    
for i in range(10):
    for j in range(i+1,10):
        if lis[i]<lis[j]:
            a=lis[i];
            lis[i]=lis[j];
            lis[j]=a;
            
for i in range(3):
    print(lis[i]);

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

a.sort()

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

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

import sys

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

def main():
    data = []
    for line in sys.stdin:
        data.append(int(line))

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

if __name__ == '__main__':
    main()

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

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

Python: array=[int(input()) for i in range(10)]
array.sort()
num = len(array)
for i in range(num-1,num-4,-1):
    print(array[i])

Python: import sys
heights = sorted([ int(h) for h in sys.stdin ], reverse=True)
print( heights[0] )
print( heights[1] )
print( heights[2] )

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

Python: n = int(input())
a = [input() for i in range(n)]
for i in range(3):
    m = max(a)
    a.remove(m)
    print (m)

Python: a=list(map(int,input().split()))
b=sorted(a)
print(b[9])
print(b[8])
print(b[7])

Python: f=s=t=0
for i in range(10):
    n=int(input())
    if(n > f):
        t = s
        s = f
        f = n
    elif(n > s):
        t = s
        s = n
    elif(n > t):
        t = n
print('%d\n%d\n%d'%(f,s,t))

Python: s=[int(input(x)) for x in range(10)]
print(sorted(s)[-1])
print(sorted(s)[-2])
print(sorted(s)[-3])

Python: a = sorted(map(int,input().split(" ")),reverse=True)
for i in range(0,3):
	print(a[i])

Python: mountains = list()
for i in range(10):
    mountains.append(int(input()))

for j in range(3):
    print(mountains.pop(mountains.index(max(mountains))))

Python: #coding: utf-8

a = []

for i in range(10):
	num = input()
	a.append(int(num))

a.sort(reverse=True)

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

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

for i,j in enumerate(sorted(lis,reverse=True)):
  print(i)
  if i==3:
    break

Python: m=list(int(input()) for i in range(10))
m.sort()
h=[print(m[i]) for i in range(9,6,-1)]

Python: 
n = [0,0,0,0,0,0,0,0,0,0]

for i in range( 0, 10 ):
    n[i] = int(input())

mv = 0
ma = 0

for i in range( 0, 3 ):
    for j in range( 0, 10 ):
        if mv < n[j]:
            mv = n[j]
            ma = j
    print( mv )
    n[ma] = -1
    mv = 0

Python: L=list(range(10))
for i in range(10):
    L[i]=int(input())
print(max(L))
L.remove(max(L))
print(max(L))
L.remove(max(L))
print(max(L))

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

a.reverse()
print(a[0])
print(a[1])
print(a[2])

Python: array = []
for _ in range(10):
    array.append(int(input()))

sorted_array = sorted(array,reverse=True)
for i in range(3):
    print(sorted_array[i])

Python: a=[]
for i in range(10):
    a.append(int(input()))
    a.sort()
    
print(f'{a[-1]}\n{a[-2]}\n{a[-3]}')

Python: mountains = [int(input()) for _ in range(10)]
print(*sorted(mountains, reverse=True)[:3], sep='\n')

Python: max = 0
middle = 0
small = 0
x = 0
for i in range(10):
	x = int(input())
	if max < x :
		middle = max
		max = x
		x = 0
	elif middle < x :
		small = middle
		middle = x
		x = 0
	elif small < x :
		small = x
		x = 0
print(max)
print(middle)
print(small)

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

m_h.sort(reverse=True)

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

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

Python: def main():
    a=[]
    for i in range(10):
        a.append(int(input()))
    a.sort()
    for j in range(-1, -4, -1):
        print(a[j], end="")

Python: rank = sorted([int(input()) for i in range(10)], reverse=True)
print('\n'.join(map(str, rank[:3])))

Python: import sys
h=[int(i) for i in sys.stdin]
h.sort()
print(h[-1])
print(h[-2])
print(h[-3])

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