Discussion on Find the Runner-Up Score! Challenge

Sort 4204 Discussions, By:

6 years ago+ 0 comments

I was trying to avoid set and sort, came up with this

i = int(input())
lis = list(map(int,raw_input().strip().split()))[:i]
z = max(lis)
while max(lis) == z:
    lis.remove(max(lis))

print max(lis)

4 years ago+ 0 comments

My solution:

if __name__ == '__main__':
    n = int(input())
    arr = map(int, input().split())
    print (sorted(set(arr))[-2])

'Set' is the key.

4 years ago+ 0 comments

Basically in one line :

    n = int(input())
    arr = list(map(int, input().split()))
    print(max([x for x in arr if x!=max(arr)]))

4 years ago+ 0 comments

print sorted(set(arr))[-2]

2 years ago+ 0 comments

a O(n) one pass solution

if __name__ == '__main__':
    n = int(input())
    arr = map(int, input().split())

    if n < 2:
        raise Exception("not found")
    
    import sys
    max_score = -sys.maxsize
    result = -sys.maxsize
    
    for a in arr:
        if a > max_score:
            result = max_score
            max_score = a
        elif a > result and a < max_score:
            result = a
    
    print(result)

Load more conversations