Problem:
List of Top 3 Hills There is a data which provides heights (in meter) of mountains. The data is only for ten mountains. Write a program which prints heights of the top three mountains in descending order. Input Height of mountain 1
Height of mountain 2
Height of mountain 3
 .
 .
Height of mountain 10 Constraints 0 ≤ height of mountain (integer) ≤ 10,000 Output Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain Sample Input 1 1819
2003
876
2840
1723
1673
3776
2848
1592
922 Output for the Sample Input 1 3776
2848
2840 Sample Input 2 100
200
300
400
500
600
700
800
900
900 Output for the Sample Input 2 900
900
800

Solution (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))

Solution (Python):

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

Solution (Python):
heightlist = list()
for i in range(10):
	heightlist.append(eval(input()))
heightlist.sort()
for i in range(-1, -4, -1):
	print(heightlist[i])

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

Solution (Python):
import sys

a = sorted([int(x) for x in sys.stdin.readlines()], reverse=True)
for i in range(3):
    print(a[i])

Solution (Python):
L = []
for _ in range(10):
    L.append(int(input()))
L.sort(reverse=True)
for m in L[:3]:
    print(m)

Solution (Python):
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Solution (Python):
import sys

hills = []
for _ in range(10):
    height = int(sys.stdin.readline().strip())
    hills.append(height)

hills.sort(reverse=True)
for i in range(3):
    print(hills[i])

Solution (Python):
a=[]
for i in range(10):
  inp=input()
  a.append(inp)
  if i>=3:
    a.sort()
    del a[0]

print a[2]
print a[1]
print a[0]

Solution (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])

Solution (Python):
import sys

l = sorted(map(int,sys.stdin.readlines()),reverse=True)
for i in l[:3]:
    print(i)

Solution (Python):

mons = list()

for i in range(0, 10):
    mons.append(int(input()))
mons = sorted(mons)
for i in range(9, 6, -1):
    print(mons[i])

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

Solution (Python):
a=[]
for i in range(10):
    num = int(input())
    a.append(num)
a=sorted(a)
for i in range(3):
    print('{0}'.format(a[9-i]))

Solution (Python):
import sys

li = []
for line in sys.stdin:
   li.append(int(line))
   if len(li) == 10:
      break

li.sort(reverse=True)
li = li[0:3]
for i in li:
   print(i)

Solution (Python):
mount = []

for i in range(0, 10):
    n = input()
    mount.append(n)

mount.sort(reverse = True)

for i in range(0, 3):
    print mount[i]

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

Solution (Python):

def LoT(List):
    List2=sorted(List)
    for i in range(3):
        print(List2[len(List)-1-i])
if __name__=="__main__":
    List=[]
    for i in range(10):
        List.append(int(input()))
    LoT(List)

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

Solution (Python):

import sys

a=[]
for line in sys.stdin:
  line.rstrip('rn')
  tmp=line.split(" ")
  a.append(int(tmp[-1]))

a.sort(reverse=True)
y=0
for i in a:
  if y==3:
    break
  if i>=0 and i<=10000:
    print(i)
    y=y+1

Solution (Python):
def main():
    mountain=[]
    for i in range(10):
        num=int(input())
        mountain.append(num)
    mountain=sorted(mountain)
    mountain=mountain[::-1]
    for i in range(3):
        print(mountain[i])

if __name__=='__main__':
    main()

Solution (Python):
a = []

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




a.sort(reverse=True)

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

Solution (Python):
heights = [int(input()) for n in xrange(10)]
for x in xrange(3):
    v = max(heights)
    print v
    heights.remove(v)

Solution (Python):
heights = sorted([int(input()) for n in xrange(10)])
for idx in range(-1, -4, -1):
    print heights[idx]

Solution (Python):
l = sorted([input() for x in xrange(10)], reverse=True)
for h in l[:3]:
    print h

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

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

Solution (Python):
a = sorted([int(input()) for i in range(10)])
a.reverse()
for i in range(3):
	print(a[i])

Solution (Python):
import fileinput

def main():
    numbers = []
    for line in fileinput.input():
        numbers.append(int(line))
    numbers = sorted(numbers, reverse=True)
    for n in numbers[0:3]:
        print n

main()

Solution (Python):
a = [0, 0, 0, 0]
for t in range(10):
    a[3] = input()
    for i in range(2, -1, -1):
        if (a[i] < a[i+1]):
            a[i], a[i+1] = a[i+1], a[i]

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

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

Solution (Python):
import sys

heights = sorted([int(h) for h in sys.stdin], reverse=True)

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

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

hs.sort(reverse = True)

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

Solution (Python):


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))

    for h in top_k_sort(data):
        print(h)

if __name__ == '__main__':
    main()

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

mol.sort(key=None,reverse=True)
for i in range(3):
    print(mol[i])

Solution (Python):
for a in sorted([int(input()) for _ in range(10)], reverse=True)[:3]:
    print(a)

Solution (Python):
data_set=[]
for i in range(0,10):
        data_set.append(input())
top=sorted(data_set,reverse=True)
for i in range(0,3):
        print(top[i])

Solution (Python):
import sys

a = []
for i in sys.stdin:
    a.append(int(i.replace("\n", "")))
a.sort(reverse=True)
del a[3:]
print( "\n".join(map(str, a)))

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

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

Solution (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

Solution (Python):

l = []
for i in range(0,10):
    l.append(int(input()))

l.sort(reverse=True)
l=l[:3]
for j in l:
    print(j)

Solution (Python):
import sys 
height_li = []
for i in range(10):
    height_li.append(int(input()))
for i in range(3):
    print(sorted(height_li,reverse=True)[i])

Solution (Python):
A = sorted([int(raw_input()) for _ in xrange(10)])
print A[9]
print A[8]
print A[7]

Solution (Python):







s = [int(raw_input()) for i in range(10)]

s.sort()

for i in range(3):
    print s[9-i]

Solution (Python):
[print(x) for x in sorted([int(input()) for _ in range(10)], reverse=True)[0:3]]

Solution (Python):
[print(y) for y in sorted([int(input()) for x in range(10)], reverse=True)[:3]]

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

Solution (Python):


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

Solution (Python):
hill = []
while True:
    try:
        hill.append(int(input()))
    except:
        break
for i in range(1, len(hill)):
    key = hill[i]
    j = i-1
    while j >= 0 and hill[j] < key:
        hill[j+1] = hill[j]
        j -= 1
    hill[j+1] = key

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

Solution (Python):
heights = []

for _ in range(10):
	heights.append(int(input()))

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

Solution (Python):
[print(e)for e in sorted([int(input())for _ in range(10)],reverse=True)[0:3]]

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

a.sort()

for i in range(1, 4):
    print(a[-i])

Solution (Python):
l=[int(input()) for _ in range(10)]
[print(x) for x in sorted(l, reverse=True)[:3]]

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

Solution (Python):


temp = []
for i in range(10):
    N = input()
    temp.append(N)
temp.sort()
print temp[-1]
print temp[-2]
print temp[-3]

Solution (Python):
High = []
for i in range(10):
    High.append(int(input()))
for i in range(3):
    print(max(High))
    High.remove(max(High))

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

top3 = []
for i in range(3):
    Max = max(values)
    top3.append(Max)
    values.remove(Max)

for x in top3:
    print(x)

Solution (Python):
if __name__ == '__main__':
    
    mountains = [int(input()) for _ in range(10)]

    
    mountains.sort(reverse=True)

    
    print('{0}\n{1}\n{2}'.format(mountains[0], mountains[1], mountains[2]))

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

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

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

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

m.sort(reverse=True)

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

Solution (Python):

N = 10
h = []
for n in range(N):
    h.append(int(input()))

h = sorted(h, reverse = True)

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

Solution (Python):
import sys

heights = []

for height in sys.stdin:
  heights.append(int(height.rstrip()))

heights.sort()
heights.reverse()

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

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

Solution (Python):
a=[]
while 1:
    try:
        a.append(int(input()))
    except: break
a.sort(reverse=1)
for i in range(3):print(a[i])

Solution (Python):


import sys

data = []
count = 0
for i in sys.stdin:
    data.append(int(i))
    count = count+1
    if count == 10:
        break

N = len(data)
m = 100

for i in range(m):
    for n in range(N-1):
        a = data[n]
        b = data[n+1]
        if a <= b:
            data[n] = b
            data[n+1] = a
        else:
            pass
for i in range(3):
    print(data[i])

Solution (Python):

def main():
    arr = []
    for i in range(0,10):
       arr.append(input()) 
    arr.sort()
    arr.reverse()
    for i in range(0,3):
        print arr[i]

if __name__ == '__main__':
    main()

Solution (Python):

mountains = []

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

mountains.sort(reverse = True)

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

Solution (Python):


a = [int(raw_input()) for _ in range(10)]

b = sorted(a, reverse=True)

for c in b[0:3]:
    print c

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

Solution (Python):
def calc_mount_1(height_list):
    for i in range(len(height_list)):
        for i in range(len(height_list)-1):
            if height_list[i+1] < height_list[i]:
                tmp = height_list[i+1]
                height_list[i+1] = height_list[i]
                height_list[i] = tmp
            else:
                continue
    return height_list

N = 10
l = [input() for i in range(N)]
answer_array = calc_mount_1(l)
print "%d" % answer_array[-1]
print "%d" % answer_array[-2]
print "%d" % answer_array[-3]

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

mountains.sort(reverse=True)

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

Solution (Python):
heights = list()
for i in range(10):
    heights.append(int(input()))
for height in list(reversed(sorted(heights)))[:3]:
    print(height)

Solution (Python):
import fileinput

mountains = []
for cnt in range(10):

    a = input()
    mountains.append(int(a))
mountains.sort()
print(mountains[9])
print(mountains[8])
print(mountains[7])

Solution (Python):



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

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


if __name__ == '__main__':
    main()

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

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

max1 = max(h)
h.remove(max1)
max2 = max(h)
h.remove(max2)
max3 = max(h)

print(max1)
print(max2)
print(max3)

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

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

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

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

Solution (Python):
height = [0 for i in range(10)]
sort_height = [0 for i in range(10)]


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


for i in range(10):
    for j in range(10):
        if height[i] >= sort_height[j]:
            
            for k in range(9, j, -1):
                sort_height[k] = sort_height[k-1] 

            sort_height[j] = height[i]
            break
        
for i in range(3):
    print(sort_height[i])

Solution (Python):
import sys
a = list(map(int,sys.stdin.readlines()))
for i in range(10):
    for j in range(i+1,10):
        if a[i] < a[j]:
            a[i],a[j] = a[j],a[i]
            
for i in range(3):
    print(a[i])

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

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

for i in range(10):
    for j in range(i,10):
        if (heights[j] > heights[i]):
            w = heights[i]
            heights[i] = heights[j]
            heights[j] = w

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

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

for i in range(10):
    for j in range(i,10):
        if (heights[j] > heights[i]):
            w = heights[i]
            heights[i] = heights[j]
            heights[j] = w

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

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

Solution (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])

Solution (Python):


import sys

if __name__ == '__main__':

    nums = []

    for line in sys.stdin:
        if line == "\n":
            break
        else :
            nums.append(int(line))

    for n in sorted(nums, reverse=True)[:3]:
        print(n)

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

Solution (Python):
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 = []
for _ in range(10):
    array.append(int(input()))

sorted_array = quicksort(array)
for i in range(3):
    print(sorted_array[9-i])

Solution (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])

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

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

values.sort(reverse=True)
for i in range(3):
    print(values[i])

Solution (Python):



import sys

def qsort( a ):
	if not isinstance(a,list):
		raise TypeError('qsort can only sort \'list\'')
	if len(a) <= 1:
		return a
	p = a[0]
	for i in range(1,len(a)):
		if a[0] != a[i]:
			if a[0] < a[i]:
				p = a[i]
			break
		elif i == len(a)-1:
			
			return a
	
	while True:
		i = 0
		j = len(a)
		for i in range( 0, len(a) ):
			if p <= a[i]:
				break
		for j in range( len(a)-1, -1, -1 ):
			if a[j] < p:
				break
		if i >= j:
			a1 = qsort( a[:i] )
			if i < len(a):
				a2 = qsort( a[i:] )
				a1.extend(a2)
			return a1
		else:
			tmp  = a[i]
			a[i] = a[j]
			a[j] = tmp

if __name__ == '__main__':
	m_list = []
	for i in range(0,10):
		m_list.append( int( sys.stdin.readline() ) )
	s = qsort(m_list)
	s.reverse()
	for i in range(0,3):
		print('{}'.format(s[i]))

Solution (Python):
inp = [int(input()) for i in range(10)]
m1, m2, m3 = 0, 0, 0
for h in inp:
    if(h > m1):
        m3 = m2
        m2 = m1
        m1 = h
    elif(h > m2):
        m3 = m2
        m2 = h
    elif(h > m3):
        m3 = h
print(m1)
print(m2)
print(m3)

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

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

h.sort(reverse=True)
for i in range(3):
	print(h[i])

Solution (Python):


list = []

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

slist = sorted(list)

for i in range(3):
    print(slist[9-i])

Solution (Python):
rank = [0] * 4
for _ in range(10):
    rank[0] = int(input())
    rank.sort()
for r in reversed(rank[1:]):
    print(r)

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

Solution (Python):
first=0
second=0
third=0

for i in range(10):
    mountain=int(input())
    if mountain>first:
        third=second
        second=first
        first=mountain
    elif mountain>second:
        third=second
        second=mountain
    elif mountain>third:
        third=mountain

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

Solution (Python):
a = [input() for i in range(10)]
a.sort(reverse=True)

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

Solution (Python):
mountain = [int(input()) for _ in range(10)]
mountain.sort()
for _ in -1, -2, -3 : print(mountain[_])

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

Solution (Python):

a=[]
for i in range(10):
    tmp = int(input())
    a.append(tmp)
b=sorted(a, reverse=True)
print(b[0])
print(b[1])
print(b[2])

Solution (Python):


def getint():
    return int(input().rstrip())

def main():
    ls = []
    num_of_mount = 10
    num_of_top = 3
    
    for i in range(num_of_mount):
        ls.append(getint())

    ls.sort(reverse=True)

    for i in range(num_of_top):
        print(ls[i])

if __name__ == '__main__':
    main()

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

Solution (Python):
mt = list()
n = 10

for i in range(n):
    mt.append(int(input()))
mt.sort(reverse=True)
for j in range(3):
    print(mt[j])

Solution (Python):
f, s, t = 3,2,1
for i in range(10):
    z = int(input())
    if z >= f:
        f,s,t = z, f, s;
    elif z>=s:
        s,t = z,s;
    elif z>=t:
        t = z
print(f);print(s);print(t)

Solution (Python):
import sys

def solve():
    a = [int(input()) for i in range(10)]
    a.sort(reverse=True)
    print(*a[:3], sep='\n')
    
if __name__ == '__main__':
    solve()

Solution (Python):
def main():
    l = []
    for _ in range(10):
        l.append(int(input()))
    l = sorted(l, reverse=True)
    for i in range(3):
        print(l[i])
    return None

if __name__ == '__main__':
    main()

Solution (Python):
n = list()

for var in range(0,10):
	n.append(int(input()))

n.sort(reverse=True)

for i in n[:3]:
	print(i)

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

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

Solution (Python):

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

Solution (Python):
ranking = []
while True:
    try:
        height = int(input())
        ranking.append(height)
    except:
        break

sortedRanking = sorted(ranking, reverse=True)
print(sortedRanking[0])
print(sortedRanking[1])
print(sortedRanking[2])

Solution (Python):
import sys
l = []
for i in range(10):
    l.append(int(sys.stdin.readline().rstrip()))
for h in sorted(l,reverse=True)[:3]:
    print(h)

Solution (Python):
a = []
for i in range(10):
    a.append(int(input()))
a.sort()
print("\n".join(list(map(str,a[9:6:-1]))))

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

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

Solution (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])

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

Solution (Python):


mountains = []
for i in range(10):
    mountains.append(int(input()))
    
outputCount = 3    
for height in list(reversed(sorted(mountains))):
    print(height)
    outputCount -= 1
    if outputCount == 0:
        break

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

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

Solution (Python):
m1 = 0;m2 = 0;m3 = 0
for i in range(1,11):
    m = int(input())
    if m>=m1:
        m3 = m2;m2 = m1;m1 = m
    elif m2<=m<m1:
        m3 = m2;m2 = m
    elif m3<=m<m2:
        m3 = m

print(m1)
print(m2)
print(m3)

Solution (Python):
import sys

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

a.sort(reverse = True)
print(a[0])
print(a[1])
print(a[2])

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

Solution (Python):
lis=list()

for a in range(1,11):
    num=int(input())
    lis.append(num)

lis.sort()
for va in range(9,6,-1):
    print(lis[va])

Solution (Python):
lists = []
for i in range(10):
    a = int(input())
    lists.append(a)
f = sorted(lists, reverse = True)
for i in range(3):
    print(f[i])

Solution (Python):
a=[]

for i in range(0,10):
    a.append(input())
inp = list(map(int,a))

INP=[0,0,0,0,0,0,0,0,0,0]

for i in range(0,10):
    for j in range(i+1,10):
        if inp[i]<inp[j]:
            INP[j]+=1
        elif inp[i]>inp[j]:
            INP[i]+=1
        else:
            INP[i]+=1
            INP[j]+=1

z = 0

for i in range(9,-1,-1):
    if z >= 3:
        break
    for j in range(0,10):
        if i == INP[j]:
            print(inp[j])
            z+=1
        if z >= 3:
            break

Solution (Python):



mount = [int(input()) for i in range(10)]
a = max(mount)
mount.remove(a)
b = max(mount)
mount.remove(b)
print(a)
print(b)
print(max(mount))

Solution (Python):
a=[int(input()) for i in range(10)]
a.sort(reverse=True)
for i, iv in enumerate(a):
	print(iv)
	if i >= 2:
		break

Solution (Python):
heightOfMountains = []
for i in range(1, 11):
	heightOfMountains.append(int(input()))
heightOfMountains.sort()
for i in range(1, 4):
	print(heightOfMountains[-i])

Solution (Python):
def ListofTopHills():
    h=[]
    for i in range(10):
        h.append(int(input()))
    h=sorted(h)

    for i in range(3):
        print(h[9-i])
        
ListofTopHills()

Solution (Python):
def get_input():
    while True:
        try:
            yield ''.join(raw_input())
        except EOFError:
            break

if __name__ == '__main__':
    l = map(int, list(get_input()))
    for elem in sorted(l)[:-4:-1]:
        print elem

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

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

Solution (Python):
mountain=[]
for s in range(0,10):
    mountain.append(int(input()))
mountain.sort(reverse=True)
for s in range(0,3):
 print(mountain[s])

Solution (Python):
print(*sorted([int(input()) for _ in [0]*10])[:6:-1], sep="\n")

Solution (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])

Solution (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])

Solution (Python):
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
a.sort()
a.reverse()
print(a[0])
print(a[1])
print(a[2])

Solution (Python):
height =[]
inp = ""
for i in range(0,10):
    inp = input()
    height.append(int(inp))
height.sort(reverse=True)
for i in range(0,3):
    print(str(height[i]))

Solution (Python):
l = []
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
f = int(input())
g = int(input())
h = int(input())
i = int(input())
j = int(input())

l.append(a)
l.append(b)
l.append(c)
l.append(d)
l.append(e)
l.append(f)
l.append(g)
l.append(h)
l.append(i)
l.append(j)

l.sort()
print(l[-1])
print(l[-2])
print(l[-3])

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

Solution (Python):
mounts = [int(input()) for i in range(1,11)]
mounts.sort()
print(mounts.pop())
print(mounts.pop())
print(mounts.pop())

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

Solution (Python):
data = []
for i in range(1,11):
	h = int(input())
	data.append(h)

for i in sorted(data)[::-1][0:3]:
	print(i)

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

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

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

spam.sort()
print(spam[-1])
print(spam[-2])
print(spam[-3])

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

Solution (Python):
lists = []
for x in range (0, 10):
    num = int(input())
    lists.append(num)
    
results = sorted(lists, reverse = True)

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

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

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

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

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

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

Solution (Python):
lst = []
for i in range(10):
    lst.append(int(input()))
for j in range(3):
    print max(lst)
    lst.remove(max(lst))

Solution (Python):
def main():
    """ ????????? """
    m = []
    for i in range(10):
        m.append(int(input()))
    m.sort(reverse=True)
    for i in range(3):
        print(m[i])

if __name__ == '__main__':
    main()

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

values.sort(reverse=True)
for v in values[:3]:
    print(v)

Solution (Python):
def main():
    m = []
    for _ in range(10):
        m.append(int(input()))

    m.sort(reverse = True)

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

if __name__ == "__main__":
    main()

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

Solution (Python):

mountain = []

for _ in range(10):
	mountain.append(int(input()))
	
mountain.sort()
mountain.reverse()

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

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

Solution (Python):


import sys, math, os


PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
    sys.stdin = open("sample-input2.txt", "rt")


for h in sorted([int(input()) for _ in range(10)], reverse=True)[:3]:
    print(h)

Solution (Python):



import sys

n = [int(input()) for i in range (1,11)] 

n.sort()
n.reverse()

for j in range (0,3):
    print(n[j])

Solution (Python):
import sys

def qsort(seq):
    if seq == []:
        return seq
    return qsort([x for x in seq[1:] if x < seq[0]]) + seq[0:1] + qsort([x for x in seq[1:] if x >= seq[0]])

data_set = []

for i in range(0, 10):
    data_set.append(int(input()))

rank = qsort(data_set)

for i in range(0,3):
    print(rank.pop(-1))

Solution (Python):
if __name__=="__main__":
    dataset = []
    for i in range(10):
        a = int(input())
        dataset.append(a)
    for j in range(3):
        print(max(dataset))
        dataset.remove(max(dataset))

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

Solution (Python):
from sys import stdin
ns = [int(n) for n in stdin]
ns.sort(reverse = True)
for i in range(3):
  print(ns[i])

Solution (Python):
from sys import stdin

for x in sorted([int(l) for l in stdin],reverse=True)[0:3]:
  print(x)

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

mountains_high_copy=mountains_high.copy()
for i in range(9):
    for j in range(9):
        if mountains_high_copy[j]>mountains_high_copy[j+1]:
            num=mountains_high_copy[j]
            mountains_high_copy[j]=mountains_high_copy[j+1]
            mountains_high_copy[j+1]=num

for i in range(3):
    print(mountains_high_copy[9-i])

Solution (Python):
num =[0,0,0]

for a in range(10):
    x = int(input().rstrip())
    if x > num[0]:
        num[2] = num[1]
        num[1] = num[0]
        num[0] = x
        continue 
    elif x > num[1]:
        num[2] = num[1]
        num[1] = x
        continue 
    elif x > num[2]:
        num[2] = x
for a in range(3):
    print(num[a])

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