1price=[10,20,4,5,4,6,46,43,4,64,65,8,45,55,558,15,5,4,6,5,255,5]
2price.sort()
3price.reverse()
4max=price[0]
5sec_max=price[1]
6print(price)
7print(f"the max is {max}, runner up is {sec_max}")
1from collections import Counter
2if __name__ == '__main__':
3 n = int(raw_input())
4 arr = Counter(map(int, raw_input().split())).keys()
5 arr.sort()
6 print arr[-2]
7
1n = int(input())
2arr = list(map(int, input().split()))
3zes = max(arr)
4i=0
5while(i<n):
6 if zes ==max(arr):
7 arr.remove(max(arr))
8 i+=1
9print(max(arr))
10#note: do not use set() will not work for negative numbers
11# contact me : sandeshbhat2000@gmail.com
1if __name__ == '__main__':
2 n = int(input())
3 arr = map(int, input().split())
4 arr = list(arr)
5 x = max(arr)
6 y = -9999999
7 for i in range(0,n):
8 if arr[i]<x and arr[i] > y:
9 y = arr[i]
10
11 print(y)
12
1if __name__ == '__main__':
2 n = int(input())
3 arr = map(int, input().split())
4 lista = list(arr)
5 lista.sort()
6 maximo = max(lista)
7 for actual in reversed(lista):
8 if actual == maximo:
9 lista.remove(max(lista))
10
11 print(max(lista))
12