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. Practice
  2. Python
  3. Basic Data Types
  4. Find the Runner-Up Score!
  5. Discussions

Find the Runner-Up Score!

  • evandam92 + 1 comment

    I think this is the best approach too to stay within O(n). My solution was something similar:

    n = int(input())
a = [int(x) for x in input().split()]
largest = secondlargest = -100
for x in a:
    if x > largest:
        tmp = largest
        largest = x
        secondlargest = tmp
    elif x > secondlargest and x != largest:
        secondlargest = x
print(secondlargest)
    • somewhatabstract + 1 comment

      You don't need that tmp var, just reorder your first condition:

      n = int(input())
a = [int(x) for x in input().split()]
largest = secondlargest = -100
for x in a:
    if x > largest:
        secondlargest = largest
        largest = x
    elif x > secondlargest and x != largest:
        secondlargest = x
print(secondlargest)
      • youngshawzju + 0 comments

        works!but a little improvement is needed