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

Submission status: Accepted

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

Submission status: Accepted

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

m.sort(reverse=True)

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

Submission status: Accepted

Solution code:
# coding: utf-8
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])

Submission status: Accepted

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

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:
a=[]
while 1:
    try:
        a.append(int(input()))
    except: break
a.sort(reverse=1)
for i in range(3):print(a[i])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:

mountains = []

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

mountains.sort(reverse = True)

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

Submission status: Accepted

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

a = [int(raw_input()) for _ in range(10)]
#print a
b = sorted(a, reverse=True)
#print b
for c in b[0:3]:
    print c

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

mountains.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import fileinput

mountains = []
for cnt in range(10):
#    for line in fileinput.input():
    a = input()
    mountains.append(int(a))
mountains.sort()
print(mountains[9])
print(mountains[8])
print(mountains[7])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

#sort
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])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
			#all are same
			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]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

list = []

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

slist = sorted(list)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a=list(map(int,input().split()))
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])

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list()

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

n.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
l = [int(raw_input()) for i in range(10)]
l.sort()
for i in range(3):
    print l[9-i]

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

hillheight.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a = []
for i in range(10):
    a.append(int(input()))
#num = [1819, 2003, 876, 2840, 1723, 1673, 3776, 2848, 1592, 922]
a.sort(reverse = True)
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

mountain = []

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Aizu Problem 0001: List of Top 3 Hills
#
import sys, math, os

# read input:
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)

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

import sys

n = [int(input()) for i in range (1,11)] 
#t = [int(input()) for i in range(n)] 
n.sort()
n.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
mountlist = []
for _ in range(10):
    height = int(input())
    mountlist.append(height)
mountlist.sort()
mountlist.reverse()
[print(x) for x in mountlist[:3]]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
import sys
line = sys.stdin.readlines()
top = [0,0,0]
for i in range(len(line)):
    line[i] = int(line[i].rstrip("\n"))
    if top[0] < line[i]:
        top[2] = top[1]
        top[1] = top[0]
        top[0] = line[i]
    elif top[1] < line[i]:
        top[2] = top[1]
        top[1] = line[i]
    elif top[2] < line[i]:
        top[2] = line[i]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

data = []

for d in sys.stdin:
  data.append(int(d))

data.sort(reverse=True)
for i in xrange(3):
  print data[i]

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:
def main():
    N=10
    l = list()
    for i in range(N):
        l.append(int(input()))
    l.sort(reverse=True)
    for x in l[:3]:
        print(x)

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
result = [0, 0, 0] 
for i in range(10):
 inp = int(raw_input())
 if result[2] >= inp:
  continue
 elif result[1] >= inp > result[2]:
  result[2] = inp
 elif result[0] >= inp > result[1]:
  result[2] = result[1]
  result[1] = inp
 else:
  result[2] = result[1]
  result[1] = result[0]
  result[0] = inp


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

Submission status: Accepted

Solution code:
import sys

data = sys.stdin.readline()
l = list()
while data:
    l.append(int(data))
    data = sys.stdin.readline()

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

Submission status: Accepted

Solution code:
import sys

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:
# coding: utf-8

import codecs
import sys

sys.stdout = codecs.getwriter("shift_jis")(sys.stdout) # ??????
sys.stdin = codecs.getreader("shift_jis")(sys.stdin) # ??\???

# ??\??¬?????????print??????????????´?????? print(u'?????????') ??¨??????
# ??\??¬?????????input??? input(u'?????????') ??§OK
# ??°?¢???????????????????????????´??????6,7???????????????????????¢??????

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

#a = [0,5,2,3,4,1]

a.sort(reverse=True)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    mountains_list = [int(input()) for n in range(10)]
    for i in range(3):
        print(list(reversed(sorted(mountains_list)))[i])
    
main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    height = []
    for _ in range(0,10):
        height.append((int)(input()))
    height.sort(reverse = True)
    print(height[0])
    print(height[1])
    print(height[2])

Submission status: Accepted

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

#a = [input() for i in range(N)]
#print a # [a1, a2, a3, ..., aN]

import sys

a = []
for line in sys.stdin:
    a.append(int(line))
#print a # [a1, a2, a3, ...]
a.sort(reverse=True)
print(a[0])
print(a[1])
print(a[2])

Submission status: Accepted

Solution code:
l = []
while True:
    try:
        x = int(input())
        l.append(x)
    except Exception:
        break
l.sort(reverse=True)
print("\n".join([str(l[0]),str(l[1]),str(l[2])]))

Submission status: Accepted

Solution code:
mountains = []

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

mountains.sort(reverse=True)

for m in mountains[0:3]:
    print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#from me.io import dup_file_stdin

#@dup_file_stdin
def solve():
    m=[]
    for line in sys.stdin:
        m.append(int(line))
    m.sort(reverse=True)
    for h in m[0:3]:
        print(h)
solve()

Submission status: Accepted

Solution code:
import sys
import operator
# l = sys.stdin.readline()
l= []
for i in xrange(10):
    l.append(int(sys.stdin.readline()))

first = max(l)
print(first)
del l[l.index(first)]
first = max(l)
print(first)
del l[l.index(first)]
first = max(l)
print(first)
del l[l.index(first)]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding=utf-8


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

Submission status: Accepted

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