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



Sample input:
1819
2003
876
2840
1723
1673
3776
2848
1592
922


Sample output:
3776
2848
2840

Submission status: Accepted

Solution code:
# usr/bin/python
# coding: utf-8
################################################################################
# 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.
#
################################################################################

if __name__ == "__main__":
    hight_of_mount  = [0]*10
    for i in range(0, 10):
        hight_of_mount[i]  = int(input())

    hight_of_mount.sort(reverse=True)

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

Submission status: Accepted

Solution code:
def main():
    moutain = []

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

    temp = sorted(moutain,reverse=True)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
rank = [0,0,0]
for i in range(10):
    t = input()
    if t > rank[0]:
        rank.insert(0, t)
        rank.pop()
    elif t > rank[1]:
        rank.insert(1, t)
        rank.pop()
    elif t > rank[2]:
        rank.insert(2, t)
        rank.pop()
print "{}\n{}\n{}".format(rank[0], rank[1], rank[2])

Submission status: Accepted

Solution code:
h = []

for x in range(0,10):
    h.append(int(input()))

h.sort()
h.reverse()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print(*sorted([int(input()) for _ in range(10)])[:-4:-1], sep="\n")

Submission status: Accepted

Solution code:
lst=[]
for n in range(10):
    lst.append(int(input()))
res=sorted(lst, reverse=True)
for i in range(3):
    print(res[i])

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
counter=3
for u in list(reversed(sorted(a))):
    print(u)
    counter-=1
    if counter==0:
        break

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
c=3
for u in list(reversed(sorted(a))):
    print(u)
    c-=1
    if c==0:
        break

Submission status: Accepted

Solution code:

#List of Top3 Hills

list=[]
while True:
    try:
        n = int(raw_input())
        list.append(n)
    except:
        break
list.sort(reverse=True)
for i in range(0,3):
    print list[i]

Submission status: Accepted

Solution code:
list=[]
for i in range(0,10):
    n = int(raw_input())
    list.append(n)
#print'---------------------'
list.sort(reverse=True)
for i in range(0,3):
    print list[i]

Submission status: Accepted

Solution code:
def main():
    Array = []
    for i in range(10):
        Array.append(int(input()))
    Array.sort()
    Array.reverse()
    count = 0
    for value in Array :
        if count == 3:
            break
        print(value)
        count+=1



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mountains = []
for i in range(0,10):
    input_line = input()
    mountains.append(int(input_line))

sorted_mountains = sorted(mountains, reverse=True)
for i in range(0, 3):
    print(sorted_mountains[i])

Submission status: Accepted

Solution code:
import sys

a = ""
l = []
for input in sys.stdin:
    a += input
for i in a.split():
    l.append(int(i))
l = sorted(l)
for i in range(len(l)-1,len(l)-4,-1):
    print int(l[i])

Submission status: Accepted

Solution code:
try:
    meters = []
    while True:
        meters.append(int(input().strip()))
except EOFError:
    meters.sort(reverse=True)
    for i in range(3):
        print(meters[i])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h=sorted([int(input())for _ in range(10)])
print(h[9],h[8],h[7],sep='\n')

Submission status: Accepted

Solution code:
print(*sorted([int(input())for _ in range(10)])[:6:-1],sep='\n')

Submission status: Accepted

Solution code:
print(*sorted(int(input())for _ in range(10))[:6:-1],sep='\n')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
e = sys.stdin.readlines()
e = [int(i) for i in e]
for i in range(3):
    m = max(e)
    e.remove(m)
    print (m)

Submission status: Accepted

Solution code:
import sys
e = [int(i) for i in sys.stdin.readlines()]
for i in range(3):
    m = max(e)
    e.remove(m)
    print (m)

Submission status: Accepted

Solution code:
def main():
    mount = []
    for i in range(10):
        mount.append(int(input()))
    
    mount.sort(reverse=True)
    for i in range(3):
        print(mount[i])
        

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from sys import stdin
highest = [0] * 3
for line in stdin:
    highest.append(int(line))
    highest.sort(reverse=True)
    highest = highest[:-1]
print('\n'.join(map(str, highest)))

Submission status: Accepted

Solution code:
mountains = sorted([int(input()) for i in range(10)])
for i in range(3):
    print(mountains[9 - i])

Submission status: Accepted

Solution code:
list = []
for count in range(10):
    list.append(input())
list = sorted(list, key=int)
a = 9
for count in range(3):
    print(list[a])
    a -= 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys                                       
import functools                                 
import itertools                                 
import math                                      
                                                 
x = sorted(list(map(int, sys.stdin.readlines())))
                                                 
[print(n) for n in x[:-4:-1]]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mountains = []
count = 0
while True:
    height = int(input())
    if height >= 0 and height <= 10000:
        mountains.append(height)
    count += 1
    if count == 10:
        break

mountains.sort()

for i in mountains[:6:-1]:
    print(i)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = 10
mnts = []

for i in range(N):
    mnts.append(int(input()))

mnts.sort(reverse=True)

for mnt in mnts[:3]:
    print(mnt)

Submission status: Accepted

Solution code:

cnt = 10
top3 = [0,0,0]

for x in xrange(cnt):
    n = int( raw_input() )

    if top3[2] > n: continue
    top3[2] = n

    if top3[1] > top3[2]: continue
    top3[1], top3[2] = top3[2], top3[1]

    if top3[0] > top3[1]: continue
    top3[0], top3[1] = top3[1], top3[0]

print top3[0]
print top3[1]
print top3[2]

Submission status: Accepted

Solution code:
li2 = sorted([int(input()) for i in range(10)], reverse=True)
print(li2[0])
print(li2[1])
print(li2[2])

Submission status: Accepted

Solution code:
heights = []
for num in range(10):
    heights.append(input())


top_heights = [int(i) for i in heights]
top_heights.sort()
top_heights.reverse()

for top in range(3):
    print(top_heights[top])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ListOfTop3Hill(l):
    l.sort()
    l.reverse()
    for i in range(3):
        print(l[i])


def main():
    # input
    N = 10
    l = [int(input()) for i in range(N)]
    # solver
    ListOfTop3Hill(l)

if __name__ == '__main__': main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mount = []
for i in range(10):
    n = int(input())
    mount.append(n)
s = sorted(mount)[::-1]
for i in range(3):
    print(s[i])

Submission status: Accepted

Solution code:
heights = []

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

print '\n'.join(str(x) for x in sorted(heights, reverse=True)[0:3])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import collections
import sys

def read_prob():
    inputs = []
    try:
        while True:
            line = input().strip()
            inputs.append(int(line))
    except EOFError:
        pass
    return inputs

if __name__ == '__main__':
    inputs = read_prob()
    so = sorted(inputs)
    so.reverse()
    for i in range(3):
        print(so[i])

Submission status: Accepted

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


data.sort()
data.reverse()

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

Submission status: Accepted

Solution code:
hills = [input() for _ in range(10)]
hills = list(map(int, hills))
hills.sort()

for i in range(3):
    print(hills.pop())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
a.sort()
a.reverse()
print(str(a[0])+"\n"+str(a[1])+"\n"+str(a[2]))

Submission status: Accepted

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

a.sort()
a.reverse()

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

Submission status: Accepted

Solution code:
m = [int(input()) for _ in range(10)]
m.sort()
[print(m[-i]) for i in range(1, 4)]

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=[]
for i in range(10):
    a.append(int(input()))
a.sort()
for j in range(-1, -4, -1):
    print(a[j])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t=sorted([int(input()) for i in range(10)])
[print(i) for i in [t[-1],t[-2],t[-3]]]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AOJ 0001 List of Top 3 Hills
# Python3 2018.6.7 bal4u

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

Submission status: Accepted

Solution code:
arr = []
for i in range (0,10):
    temp = int(input(""))
    arr.append(temp)

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

Submission status: Accepted

Solution code:
lst = [int(input()) for _ in range(10)]
lst.sort()
for i in range(3):
    print(lst[9 - i])

Submission status: Accepted

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

h.sort()
h.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

Solution code:
first = 0;
second = 0;
third = 0;
for var in range(0,10):
	N = int(input())
	if (N>first):
		third = second
		second = first
		first = N
	elif (N>second):
		third = second
		second = N
	elif (N>third):
		third = N
print (first)
print (second)
print (third)

Submission status: Accepted

Solution code:
# AOJ 0001 List of Top 3 Hills
# Python3 2018.6.7 bal4u

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(input()) for i in range(10)]
print(*sorted(a, reverse=True)[0:3], sep='\n')

Submission status: Accepted

Solution code:
print(*sorted([int(input()) for i in range(10)])[:6:-1], sep='\n')

Submission status: Accepted

Solution code:
def run():
    mount_t = sorted([int(input()) for _ in range(10)])
    for i in range(3):
        print(mount_t[9 - i])



if __name__ == '__main__':
    run()

Submission status: Accepted

Solution code:
def run():
    n = []
    for _ in range(10):
        n.append(int(input()))
    n = sorted(n, reverse=True)
    print('\n'.join([str(_n) for _n in n[:3]]))

if __name__ == '__main__':
    run()

Submission status: Accepted

Solution code:
print "\n".join([str(x) for x in (sorted([input() for i in range(10)])[:-4:-1])])

Submission status: Accepted

Solution code:
list=[]
for i in range(0, 10):
    n = int(raw_input())
    list.append(n)
    
list.sort(reverse=True)

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

Submission status: Accepted

Solution code:
list=[]
for i in range(0, 10):
    n = int(raw_input())
    list.append(n)
     
list.sort(reverse=True)
 
for i in range(0, 3):
    print list[i]

Submission status: Accepted

Solution code:
import sys

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

a.sort(lambda x, y: y - x)

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-

def sort(lst):
  for i in range(len(lst)):
    m = i
    for j in range(i+1,len(lst)):
      if lst[j] > lst[m]:
        m = j
    # swapping 
    tmp = lst[i]
    lst[i] = lst[m]
    lst[m] = tmp
  return lst

lst=[] # initialize
for i in range(10):
  lst.append(int(input()))
lst = sort(lst)
print("%d\n%d\n%d"%(lst[0],lst[1],lst[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h = []
while len(h)<10:
    h.append(input())
h.sort()
for i in range(3):
    print h[9-i]

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys

def main():
    list = []
    for i in range(10):
        list.append(int(input()))
    list.sort(lambda num_1, num_2: num_2 - num_1)
    for i in range(3):
        print(list[i])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

input_list = list()

for i in sys.stdin.readlines():
    i = i.strip()
    i = int(i)
    input_list.append(i)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = 0
arr = list()
while i<10:
    j = int(raw_input())
    arr.append(j)
    i+=1

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

Submission status: Accepted

Solution code:
i = 0
arr = list()
for i in range(10):
  arr.append(raw_input())

for h in sorted(map(int, arr), reverse = True)[:3]:
  print h

Submission status: Accepted

Solution code:
lst = []
for i in range(10):
    lst.append(input())

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

Submission status: Accepted

Solution code:
#coding: UTF-8

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

list.sort(reverse = True)

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

Submission status: Accepted

Solution code:
a=[]
for x in range(10):
    a.append(input())

a.sort(reverse=True)
for x in range(3):
    print a[x]

Submission status: Accepted

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

list.sort(reverse=True)

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

Submission status: Accepted

Solution code:
height = []
while 1:
    try:
        height.append(input())
    except EOFError:
        break
height.sort(reverse=True)
for i in range(3):
    print height[i]

Submission status: Accepted

Solution code:

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


m.sort()

print m[-1]
print m[-2]
print m[-3]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8


def main():
    inputs = []
    for i in xrange(10):
        inputs.append(int(raw_input()))
    inputs.sort()
    inputs.reverse()
    for i in inputs[:3]:
        print i


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a=[input() for i in xrange(10)]
a.sort(reverse=True)
for i in range(3):
    print a[i]

Submission status: Accepted

Solution code:
def sort_hills(lists):
    lists.sort()
    lists.reverse()
    return lists

x1=input()
x2=input()
x3=input()
x4=input()
x5=input()
x6=input()
x7=input()
x8=input()
x9=input()
x10=input()

listA=[x1,x2,x3,x4,x5,x6,x7,x8,x9,x10]
listA=sort_hills(listA)
print listA[0]
print listA[1]
print listA[2]

Submission status: Accepted

Solution code:
print '\n'.join(map(str, list(reversed(list(sorted(map(lambda x:int(raw_input()), range(10))))[7:]))))

Submission status: Accepted

Solution code:
l = [];
for i in range(10):
    l.append(int(raw_input().strip()))
l.sort(lambda x, y: y - x);
for a in l[:3]:
    print a

Submission status: Accepted

Solution code:
l = []
for i in range(10):
    l.append(input())
l.sort(lambda x, y: y - x);

for k in l[:3]:
    print k;

Submission status: Accepted

Solution code:
nums = []
while True:
    try:
        nums.append(int(raw_input()))
    except (EOFError):
        break
nums.sort(reverse=True)
for i in range(3): print nums[i]

Submission status: Accepted

Solution code:
list = []
for x in range(10):
    y=input()
    list.append(y)
list = sorted(list)
list.reverse()
for x in range(3):
    print list[x]

Submission status: Accepted

Solution code:
#!/usr/bin/python                                                                                                                                            
import sys

a = 10*[0]
for i in range(10):
    h = raw_input()
    a[i] = int(h)
a.sort()
print a[-1]
print a[-2]
print a[-3]

Submission status: Accepted

Solution code:
l=[]
while True:
    try:
        l.append(input())
    except EOFError:
        break
l.sort(reverse = True)
for i in range(3):
    print l[i]

Submission status: Accepted

Solution code:
from __future__ import absolute_import, print_function, unicode_literals
import sys

for h in sorted((int(line) for line in sys.stdin), reverse=True)[:3]:
    print(h)

Submission status: Accepted

Solution code:
x = []
a = 1
while True:
	if a != 11:
		x.append(int(raw_input()))
		a += 1
		continue
	else:
		break
x.sort()
print x[9]
print x[8]
print x[7]

Submission status: Accepted

Solution code:
ans = []
def main():
    for i in range(10):
        ans.append(input())
    else:
        ans.sort()
    print "{}\n{}\n{}".format(ans[-1],ans[-2],ans[-3])

main()

Submission status: Accepted

Solution code:
for x in sorted([int(raw_input()) for _ in range(10)],reverse=1)[:3]:print x

Submission status: Accepted

Solution code:
from sys import stdin

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

x.sort(reverse=True)

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

Submission status: Accepted

Solution code:
a = [];
for i in range(10):
  a.append(input());

a.sort(lambda x, y: y - x);

for i in a[:3]:
  print i;

Submission status: Accepted

Solution code:
res = []
for l in range(0,10):
    res.append(input())
res = sorted(res, reverse=True)
for i in range(0,3):
    print res[i]

Submission status: Accepted

Solution code:
a=[input() for i in range(10)]
a.sort()
print "%d\n%d\n%d"%(a[-1],a[-2],a[-3])

Submission status: Accepted

Solution code:
hs = [input() for _ in xrange(10)]
hs.sort()
for _ in xrange(3):
    print hs.pop()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = []
for i in range(10):
    data.append(int(raw_input()))

m1 = m2 = m3 = 0 
for i in data:
    if 0 <= i <= 10000:
        if m1 <= i:
            m3 = m2
            m2 = m1
            m1 = i 
        elif m2 <= i < m1:
            m3 = m2
            m2 = i 
        elif m3 <= i < m2:
            m3 = i 

print "{}\n{}\n{}".format(m1, m2, m3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lis = []
for i in xrange(10):
 lis.append(input())
for a in sorted(lis,reverse=True)[:3]:
 print a

Submission status: Accepted

Solution code:
import sys

file = sys.stdin
lis = file.readlines()
lis = map(int, lis)
lis.sort()
lis.reverse()

for height in lis[0:3]:
    print height

Submission status: Accepted

Solution code:
import sys
import fileinput

def main():
    for height in sorted(map(lambda x: int(x), fileinput.input()), reverse = True)[:3]:
        print height
    return 0

if __name__ == "__main__":
    sys.exit(main())

Submission status: Accepted

Solution code:
list = list()
for i in xrange(10):
	list.append(input())
list.sort()
list.reverse()
for i in xrange(3):
	print list[i]

Submission status: Accepted

Solution code:
print "\n".join(map(str,sorted([input() for _ in xrange(10)], reverse = True)[:3]))

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

Solution code:
ans = []
while True:
    try:
        ans.append(raw_input())
    except:
        break
ans.sort(key=int)
ans.reverse()
print "\n".join(ans[:3])

Submission status: Accepted

Solution code:
print "\n".join(sorted([raw_input() for x in xrange(10)], key=int)[::-1][:3])

Submission status: Accepted

Solution code:
# -*- utf-8 -*-

mo = [];

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

mo.sort(reverse=True)


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

Submission status: Accepted

Solution code:
l = []
for x in range(10) :
  n = int(raw_input())
  l.append(n)

print '\n'.join(map(str, reversed(sorted(l)))[:3])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: UTF-8

num = []

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

num.sort()

print num[-1]
print num[-2]
print num[-3]

Submission status: Accepted

Solution code:
import sys
    
n=10
x=[]
for i in range(n):
    tmp = input()
    x.append(tmp)

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

Submission status: Accepted

Solution code:
fir=0
sec=0
thi=0

for a in range(0,10):
        a=input()
        if a >= fir:
                sec,thi = fir,sec
                fir = a
        elif a >= sec:
                thi = sec
                sec = a
        elif a >= thi:
                thi = a

print fir
print sec
print thi

Submission status: Accepted

Solution code:
m = sorted([int(raw_input()) for i in range(10)], reverse = True)
for i in m[:3]:
    print i

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# List of Top 3 Hills

import sys

mountains = []

for line in sys.stdin:
    mountains.append(int(line))

mountains.sort(reverse=True)

print mountains[0]
print mountains[1]
print mountains[2]

Submission status: Accepted

Solution code:
a = []
for x in range(10):
        a += [int(input())]
for x in range(3):
        print(max(a))
        a.remove(max(a))

Submission status: Accepted

Solution code:
hs = []
for i in xrange(10):
    hs.append(int(raw_input()))

hs.sort()

print hs[9]
print hs[8]
print hs[7]

Submission status: Accepted

Solution code:
import sys
heights = []
for line in sys.stdin:
    heights.append(int(line.rstrip('\n')))
for height in sorted(heights, reverse=True)[:3]:
    print height

Submission status: Accepted

Solution code:
#!/usr/bin/env python

def lot3h():
    mounts = []
    for i in range(10):
        mounts.append(int(raw_input()))
    mounts.sort()
    mounts.reverse()
    for i in range(3):
        print "%d\n" % mounts[i] ,
    return

if __name__ == "__main__":
    lot3h()

Submission status: Accepted

Solution code:
import sys

l = sorted([int(s) for s in sys.stdin], reverse=True)[:3]
print '\n'.join([str(s) for s in l])

Submission status: Accepted

Solution code:
#!/usr/bin/env python
#coding:utf-8
import sys

dat=[]
for i in range(0,10):
    val=raw_input()
    dat.append(int(val))
dat.sort()
dat.reverse()
for i in range(0,3):
    print dat[i]

Submission status: Accepted

Solution code:
#!/usr/bin/env python
#coding:utf-8
dat=[]
for i in range(0,10):
    val=raw_input()
    dat.append(int(val))
dat.sort()
dat.reverse()
for i in range(0,3):
    print dat[i]

Submission status: Accepted

Solution code:
first = -1
second = -1
third = -1
for i in xrange(10):
  height = int(raw_input())
  if first < height:
    third = second
    second = first
    first = height
  else:
    if second < height:
      third = second
      second = height
    else:
      if third < height:
        third = height

print first
print second
print third

Submission status: Accepted

Solution code:
x = []
for i in range(10):
	x.append(input())
x.sort()
for j in range(-1,-4,-1):
	print(x[j])

Submission status: Accepted

Solution code:
import sys
x=[]
for i in range(10):x+=[input()]
for i in sorted(x)[:-4:-1]:print i

Submission status: Accepted

Solution code:
import sys
for i in sorted(map(int,sys.stdin))[:-4:-1]:print i

Submission status: Accepted

Solution code:
import sys
x=sorted(map(int,sys.stdin))[:-4:-1]
for i in x:print i

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list()

for var in range(0, 10):
  n.append( int(raw_input()) )
  
n.sort(reverse = True)
  
for var in range(0, 3):
  print n[var]

Submission status: Accepted

Solution code:
a = [0 for i in range(10)]

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

a.sort()
a.reverse()

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

Submission status: Accepted

Solution code:
heights = []
for n in range(10):
  heights.append(int(raw_input()))
heights = sorted(heights)[::-1]
for h in heights[:3]:
  print h

Submission status: Accepted

Solution code:
import sys

array = [0 for i in range(10)]

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

array.sort()
array.reverse()

for j in range(3):
  print str(array[j])

sys.exit()

Submission status: Accepted

Solution code:
m=[]
for i in range(10):
    m.append(int(raw_input()))
m.sort()
for i in range(-1,-4,-1):
    print m[i]

Submission status: Accepted

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

for i in range(len(a)):
    for s in range(i+1,len(a)):
        if a[i] < a[s]:
            tmp = a[s]
            a[s] = a[i]
            a[i] = tmp


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
m = []
for i in range(10):
    m.append(input())
m.sort(reverse=True)
print '\n'.join(map(str, m[:3]))

Submission status: Accepted

Solution code:
a = []
try:
    while True:
        a.append(int(raw_input()))
except:
    pass
a.sort()
for i in range(-1, -4, -1):
    print a[i]

Submission status: Accepted

Solution code:
from sys import stdin

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

x.sort(reverse=True)

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

Submission status: Accepted

Solution code:
a = [int(raw_input()) for i in xrange(10)]
a.sort()
a.reverse()
print a[0]
print a[1]
print a[2]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = []
for i in xrange(10):
	s.append(int(raw_input()))
s.sort()
s.reverse()
for i in xrange(3):
	print s[i]

Submission status: Accepted

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