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):
m1=m2=m3=0
for i in range(10):
    m3=max(m3,int(input()))
    if m3>m2:m2,m3=m3,m2
    if m2>m1:m1,m2=m2,m1
print(m1)
print(m2)
print(m3)

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

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

Solution (Python):
mount_list = []

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

mount_list.sort(reverse = True)

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

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

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

Solution (Python):

a = []

while True:
    try:
        n = int(input())
        a.append(n)
    except:
        break

print(max(a))
a.remove(max(a))
print(max(a))
a.remove(max(a))
print(max(a))

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

Solution (Python):
def __main():

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

__main()

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

Solution (Python):
h=sorted([int(input()) for _ in range(10)])[::-1]
for i in h[0:3]:
    print(i)

Solution (Python):
mh=[]

for i in range(1,11):
    mh.append(int(input()))

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

Solution (Python):
a_list = []
for i in range(10):
    while True:
        a = input()
        a = int(a)
        if 0<=a and a<=10000:break
    a_list.append(a)

for i in range(3):
    print(max(a_list))
    a_list.remove(max(a_list))

Solution (Python):
mountains = []

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

mountains.sort(reverse=True)

for height in mountains[:3]:
    print(height)

Solution (Python):
Height = [0]*10

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

Solution (Python):

arr = list([])

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

arr.sort(reverse=True)

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

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

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

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

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

Solution (Python):
mountains = []

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

mountains.sort(reverse=True)

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

Solution (Python):
max = [0,0,0]
for a in range(10):
    s = int(input())
    if max[0] < s:
        max[2] = max[1]
        max[1] = max[0]
        max[0] = s
    elif max[1] < s:
        max[2] = max[1]
        max[1] = s
    elif max[2] < s:
        max[2] = s
for a in max:
    print(a)

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

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

Solution (Python):


import sys


ff = sys.stdin

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

arr.sort(reverse=True)

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

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

Solution (Python):
for i in sorted([input() for _ in xrange(10)])[:-4:-1]: print i

Solution (Python):
import sys



i=0
list = []
for line in sys.stdin.readlines():
	list.append(int(line.strip("\n")))

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

Solution (Python):
l=[]
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.append(int(input()))
l.sort()
l.reverse()
print l[0]
print l[1]
print l[2]

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

Solution (Python):





li = []
for x in range(10):
    s = input()
    s = int(s)
    li.append(s)

li.sort()
li.reverse()

for y in range(3):
    print(li[y])

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

Solution (Python):
p1 = 0
p2 = 0
p3 = 0
for i in range(10):
    d = int(raw_input())
    if (d > p1):
        p3 = p2
        p2 = p1
        p1 = d
    elif (d > p2):
        p3 = p2
        p2 = d
    elif (d > p3):
        p3 = d

print p1
print p2
print p3

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

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

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

Solution (Python):
for i in sorted([input() for _ in [0]*10])[-1:-4:-1]:print i

Solution (Python):
import sys
mt_heights = map(int, sys.stdin.readlines())
mt_heights.sort(reverse=True)
for height in mt_heights[:3]:
    print height

Solution (Python):



import sys

data = map(int,sys.stdin.read().split())
data.sort()
data.reverse()
for s in data[:3]:
  print s

Solution (Python):
import sys
a = []
s = sys.stdin.readline()
while s :
	a.append(int(s))
	s = sys.stdin.readline()

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

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

Solution (Python):



import os
import sys

class Hoge(object):
    
    def __init__(self):
        pass

    def func(self):
        '''
        insert your code
        '''
        h = reversed(sorted(input() for i in range(10)))
        for i, e in enumerate(h):
            if i <= 2:
                print e
        return None

if __name__ == '__main__':
    h = Hoge()
    h.func()

Solution (Python):



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

for i in range(0,3):
    print(list(reversed(sorted(m)))[i])

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

Solution (Python):
import sys
mount_list = map(int, sys.stdin.readlines())
mount_list.sort(reverse=True)
for x in mount_list[:3]:
	print x

Solution (Python):


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

ret.sort()

print(ret[-1])
print(ret[-2])
print(ret[-3])

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

Solution (Python):
import sys
tmp = []
for i  in range(10):
  line = input()
  tmp.append(line)
tmp.sort()
print tmp[-1]
print tmp[-2]
print tmp[-3]

Solution (Python):
hills = [input() for x in xrange(10)]
hills.sort(reverse=True)
for x in xrange(3):
	print hills[x]

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

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

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

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

Solution (Python):
H = []
while True:
	try:
		H.append(input())
	except EOFError:
		break
H.sort()
print(H[-1])
print(H[-2])
print(H[-3])

Solution (Python):

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

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

Solution (Python):


m=[int(input()) for i in range(10)]
m.sort()
m.reverse()
print("{0}\n{1}\n{2}".format(m[0], m[1], m[2]))

Solution (Python):

inputs=[]
for i in range(0,10):
    inputs.append(input())
inputs.sort(reverse=True)

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

Solution (Python):
data = []

for i in range(10):
	data.append(int(raw_input()))

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

Solution (Python):
import sys
heights = [int(i) for i in sys.stdin.read().split()]
heights.sort(reverse=True)
print("\n".join(map(str, heights[:3])))

Solution (Python):
ls = []
while True:
    try:
        n = int(raw_input())
    except EOFError:
        break

    ls.append(n)

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

Solution (Python):
L=[]

for i in range(0,10):
    x = raw_input()
    L.append(int(x))
L.sort()

for i in range(0,3):
    print L.pop()

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

Solution (Python):



h = [int(input()) for i in range(10)]
h.sort()
h.reverse()

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

Solution (Python):
A=[]
for i in range(10):
    A.append(int(raw_input()))
A.sort()
print A[-1]
print A[-2]
print A[-3]

Solution (Python):
inputNum = []

for i in range(0, 10):
  inputNum.append(int(raw_input()))

inputNum.sort(reverse=True)

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

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

Solution (Python):
a = list(reversed(sorted([int(raw_input()) for _ in range(10)])))
print a[0]
print a[1]
print a[2]

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

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

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

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

Solution (Python):

if __name__ == '__main__':
	hills = []
	for i in range(10):
		tmp = raw_input()
		hills.append(int(tmp))
	hills.sort(reverse=True)

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

Solution (Python):
mnts = []
for t in xrange(0, 10):
	mnts.append(int(raw_input()))
tops = sorted(mnts, reverse = True)
for i in xrange(0, 3):
	print tops[i]

Solution (Python):
m = []
while True:
	try:
		m.append(int(raw_input()))
	except EOFError:
		break
m.sort()
m.reverse()
for h in m[0:3]:
	print h

Solution (Python):
for h in sorted([input() for i in range(10)])[:-4:-1]:print h

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

Solution (Python):


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

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

hills.sort()
hills.reverse()

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

Solution (Python):

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

list = sorted(array)
print(list[9])
print(list[8])
print(list[7])

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

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

Solution (Python):
firstMountainHeight  = 0
secondMountainHeight = 0
thirdMountainHeight  = 0

while 1:

	try :

		i = int(raw_input())

		if firstMountainHeight    < i :
			thirdMountainHeight  = secondMountainHeight
			secondMountainHeight = firstMountainHeight
			firstMountainHeight  = i

		elif secondMountainHeight < i :
			thirdMountainHeight  = secondMountainHeight
			secondMountainHeight = i
			
		elif thirdMountainHeight  < i :
			thirdMountainHeight   = i
			
    	except:
	    	print"%d" % (firstMountainHeight)
	    	print"%d" % (secondMountainHeight)
	    	print"%d" % (thirdMountainHeight)

	    	break

Solution (Python):
firstMountainHeight  = 0
secondMountainHeight = 0
thirdMountainHeight  = 0
while 1:
	try :
		i = int(raw_input())
		if firstMountainHeight<i:
			thirdMountainHeight=secondMountainHeight
			secondMountainHeight=firstMountainHeight
			firstMountainHeight=i
		elif secondMountainHeight<i:
			thirdMountainHeight=secondMountainHeight
			secondMountainHeight=i
		elif thirdMountainHeight<i:
			thirdMountainHeight=i
    	except:
	    	print"%d" % (firstMountainHeight)
	    	print"%d" % (secondMountainHeight)
	    	print"%d" % (thirdMountainHeight)
	    	break

Solution (Python):
one  = 0
two = 0
three  = 0
while 1:
	try :
		i = int(raw_input())
		if one<i:
			three=two
			two=one
			one=i
		elif two<i:
			three=two
			two=i
		elif three<i:
			three=i
    	except:
	    	print"%d" % (one)
	    	print"%d" % (two)
	    	print"%d" % (three)
	    	break

Solution (Python):
one=0
two=0
three=0
while 1:
	try:
		i=int(raw_input())
		if one<i:
			three=two
			two=one
			one=i
		elif two<i:
			three=two
			two=i
		elif three<i:
			three=i
    	except:
	    	print"%d"%(one)
	    	print"%d"%(two)
	    	print"%d"%(three)
	    	break

Solution (Python):
heights = sorted([input() for _ in xrange(10)])
for i in xrange(1, 4):
    print heights[-i]

Solution (Python):
data = [0]

for i in range(10):
    data.append(int(input()))
    
data = sorted(data)
data.reverse()

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

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

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

Solution (Python):





height = [0 for _ in range(10)]
for i in range(10):
    height[i] = int(raw_input())

top3 = sorted(height)[:6:-1]
for h in top3:
    print h

'''
sample input
1819
2003
876
2840
1723
1673
3776
2848
1592
922
'''

Solution (Python):

"""
aizu 0001
"""

import sys


def main():
    mountaines=[]
    for line in sys.stdin:
        mountaines.append(int( line ))
    mountaines.sort(reverse=True)
    for index,x in enumerate( mountaines ):
        print x
        if index >=2:
            break
if __name__ == '__main__':
    main()

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

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

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

myList.sort()
myList.reverse()

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

Solution (Python):
if __name__ == "__main__":
    a = []
    for i in range(0,10):
        val = input()
        a.append(int(val))

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

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

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

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

l.sort()
l.reverse()

for a in l[:3]:
	print a

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

inputList.sort()
length = len(inputList)
for i in range(3):
    print(inputList[length - i - 1])

Solution (Python):


def main():
    List=[]

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

    List.sort(reverse=True)
    print(List[0])
    print(List[1])
    print(List[2])
        
 
if __name__ == '__main__':
    main()

Solution (Python):
import sys

arr = []
for i in sys.stdin:
    arr.append(int(i))

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

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

Solution (Python):
mountain = []

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

mountain.sort(reverse = True)

for j in range(3):
	print(mountain[j])

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

Solution (Python):
import sys


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

    for _ in range(3):
        print max(l)
        l.remove(max(l))

main()

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

Solution (Python):
s = 10*[0]

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

s.sort(reverse = True)

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

Solution (Python):
heap = []
while True:
    try:
        n = int(raw_input())
        if len(heap) == 0:
            heap.append(n)
        elif len(heap) == 1:
            if n <= heap[0]:
                heap.append(n)
            else:
                heap.insert(0, n)
        elif len(heap) == 2:
            if n > heap[0]:
                heap.insert(0, n)
            elif n <= heap[1]:
                heap.append(n)
            else:
                heap.insert(1, n)
        elif n > heap[2]:
            if n >= heap[0]:
                heap.insert(0, n)
            elif n >= heap[1]:
                heap.insert(1, n)
            else:
                heap.insert(2, n)
            heap.pop()
    except (EOFError):
        break
for num in heap:
    print num

Solution (Python):


lst = [int(raw_input()) for i in range(10)]
lst.sort()
lst.reverse()

print lst[0]
print lst[1]
print lst[2]

Solution (Python):
mt = []

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

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

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

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

Solution (Python):
res = []
while True:
    try:
        n = input()
        res.append(n)
    except EOFError:
    	break
res.sort()
res = res[len(res)-3:]
for x in reversed(res):
	print x

Solution (Python):
import sys
heights = []
for i in range(10):
    line = sys.stdin.readline()
    height = int(line)
    heights.append(height)
heights.sort()
heights.reverse()
for i in range(3):
    print (heights[i])

Solution (Python):
a=[]
for i in range(1,11):
    b=int(input())
    a.append(b)
a.sort(reverse=True)
for i in range(3):
    print(a[i])

Solution (Python):
def get_input():
    while True:
        try:
            yield ''.join(raw_input().strip())
        except EOFError:
            break
height = list(get_input())
height = sorted(map(int,height),reverse=True)
print height[0]
print height[1]
print height[2]

Solution (Python):
li = []
for i in xrange(10):
    s = map(str, raw_input().split())
    li.append(int(s[-1]))
li.sort(reverse=True)
for i in xrange(3):
    print li[i]

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

Solution (Python):
mountains = []
for x in range(10):
  mountains.append(int(raw_input()))

mountains.sort()
mountains.reverse()
print mountains[0]
print mountains[1]
print mountains[2]

Solution (Python):
import sys
def solve():

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

    a.sort()
    a.reverse()
    for k in xrange(3):
        print a[k]
if __name__ == '__main__':
    solve()

Solution (Python):
import sys
print('\n'.join(map(str, sorted([int(h.strip()) for h in sys.stdin], reverse=True)[:3])))

Solution (Python):
import sys

a = []
for line in sys.stdin:
    a.append(int(line))
b = [0, 0, 0]
for i in a:
	j = 0
	while j < 3:
		if i > b[j]:
			b.insert(j, i)
			break
		j += 1

for i in b[:3]:
	print i

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

Solution (Python):


array = []
for i in range(10):
 line = int(input())
 array += [line]

result = sorted(array)[::-1]

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

Solution (Python):

mt=[]
high=[0,0,0]
for i in range(10):
    mt.append(int(input()))
    if  mt[i] > high[0]:
        high=[mt[i]]+high[:2]
    elif mt[i] > high[1]:
        high=[high[0]]+[mt[i]]+[high[1]]
    elif mt[i] > high[2]:
        high=high[:2]+[mt[i]]
print ('\n'.join(map(str,high)))

Solution (Python):
import string
import sys


ip = sys.stdin.readlines()
for i in range(len(ip)):
    ip[i] = int(ip[i].strip("\n"))


h = [0]*3


for i in range(len(ip)):
    for j in range(len(ip)):
        if ip[i] > ip[j]:
            tmp = ip[i]
            ip[i] = ip[j] 
            ip[j] = tmp            

for i in range(3):
    if h != 0:
        print(ip[i])

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

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

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

Solution (Python):
M = [0 for i in xrange(10)]

for i in xrange(10):
    M[i] = int(raw_input())
    
M.sort()
M.reverse()

for i in xrange(3):
    print M[i]

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

Solution (Python):
mtheight = []
 
for i in xrange(0,10):
    mtheight.append(input())
 
mtheight.sort()
for i in xrange(0,3):
    print mtheight[9 - i]

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

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

Solution (Python):


l = []
for i in xrange(10):
    a = input()
    l.append(a)

for n in xrange(3):
    print(max(l))
    l.remove(max(l))

Solution (Python):
x = []

for i in xrange(10):
    x.append(input())

x.sort()
x = x[::-1]
for i in xrange(3):
    print x[i]

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):
hills = []
for i in range(10):
    hills.append(int(input()))

hills.sort()
hills.reverse()

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

Solution (Python):


hills_list = []
while len(hills_list) != 10:
    hills = raw_input()
    if (10000 >= int(hills)) and (int(hills) >= 0):
        hills_list.append(int(hills))
hills_list.sort()
print hills_list[-1]
print hills_list[-2]
print hills_list[-3]

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

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

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

mountains.sort()
mountains.reverse()

for n in [0,1,2]:
	print(mountains[n])

Solution (Python):


import sys

def merge(A, left, mid, right):
    n1 = mid-left
    n2 = right-mid
    L = [0]*(n1+1)
    R = [0]*(n2+1)
    for i in range(n1):
        L[i] = A[left+i]
    for i in range(n2):
        R[i] = A[mid+i]
    L[n1] = R[n2] = sys.maxint
    i = j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1

def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)/2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right)

M = [int(raw_input()) for i in range(10)]
mergeSort(M, 0, len(M))
for i in range(1, 4):
    print M[len(M)-i]

Solution (Python):
import sys
ms =list(map(int, sys.stdin.read().rstrip('\n').split('\n')))
ms.sort()
ms.reverse()
for i in range(3):
    print(ms[i])

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

for height in height_list[:3]:
    print height

Solution (Python):


list = []
for i in range(10):
    list.append(int(raw_input()))


for i in range(3):
    max = list[0]
    idx = 0
    for i in range(len(list)):
        if i != idx and list[i] > max:
            max = list[i]
            idx = i
    print max
    del list[idx]

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

Solution (Python):
hight = []

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

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

Solution (Python):


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

Solution (Python):
s = list()

for i in range(10):
    s.append(input())

s.sort(reverse = True)

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

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

Solution (Python):
l = []

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

l.sort()

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

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

Solution (Python):
A=[]
F=[]
for i in range(0,10):
    B1=raw_input()
    B=int(B1)
    A.append(B)
for i in range(0,10):
    F.append(1)

for num in range(0,3):
    M=0
    m=0
    for i in range(0,10):    
        if(M<A[i]):
            if(F[i]==1):
                M=A[i]
                m=i
    print(M)
    F[m]=0

Solution (Python):
import sys

list = []

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

list.sort()
list.reverse()

print list[0]
print list[1]
print list[2]

Solution (Python):


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

for i in range(0,10):
    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)

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

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

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

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

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

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

Solution (Python):
import itertools

l = [int(input()) for i in range(10)]
r = reversed(sorted(l))
for x in itertools.islice(r, 3):
    print(x)

Solution (Python):
def qsort(l):
    if l == []: return []
    else:
        pv = l[0]
        left = []
        right = []
        for i in range(1, len(l)):
            if l[i] > pv:
                left.append(l[i])
            else:
                right.append(l[i])
        left = qsort(left)
        right = qsort(right)
        left.append(pv)
        return left + right

def main():
    lst = []
    for i in range(0, 10):
        lst.append(int(raw_input()))

    lst = qsort(lst)
    for i in range(0, 3):
        print(lst[i])

main()

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

Solution (Python):
order=[]
for number in range(10):
    hight=int(input())
    order.append(hight)
for j in range(9):
    for i in range(9):
        if order[i] < order[i+1]:
            a = order[i]
            b = order[i+1]
            order[i] = b
            order[i+1] = a
for i in range(3):
    print(order[i])

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

Solution (Python):
a=[]

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

Solution (Python):
mountains = []
for x in range(10):
    mountains.append(int(raw_input()))
mountains.sort()
print(mountains[-1])
print(mountains[-2])
print(mountains[-3])

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

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

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

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

Solution (Python):

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

Solution (Python):


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

h = sorted(h,reverse = True)
for i in h[:3]:
	print(i)

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

Solution (Python):
s = []

for i in range(10):
  s.append(int(raw_input()))

s.sort()

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

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

m.sort()

print (m[9]);
print (m[8]);
print (m[7]);

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

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