We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Basic Data Types
  4. Find the Runner-Up Score!
  5. Discussions

Find the Runner-Up Score!

Sort 5760 Discussions, By:

  • nnk94087
     + 239 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)

  • qingchen
     + 27 comments

    My solution:

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

    'Set' is the key.

  • touihri_rania
     + 14 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)]))

  • SandyElms
     + 6 comments
    print sorted(set(arr))[-2]

  • qudongfang
     + 3 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