Created
July 9, 2022 05:03
-
-
Save Venkat-Swaraj/4bbe20de662e8fca1940c7cb4bc1c6e6 to your computer and use it in GitHub Desktop.
HackerRank(Find the Runner-up score)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
''' | |
Given the participants' score sheet for your University Sports Day, you are required to find the | |
runner-up score. You are given n scores. Store them in a list and find the score of the runner-up. | |
Input Format | |
The first line contains n. The second line contains an array A[] of n integers each separated | |
by a space. | |
Output Format | |
Print the runner-up score. | |
Sample Input 0 | |
5 | |
2 3 6 6 5 | |
Sample Output 0 | |
5 | |
Explanation 0 | |
Given list is [2, 3, 6, 6, 5]. The maximum score is 6, second maximum is 5. Hence, we print 5 | |
as the runner-up score. | |
''' | |
if __name__ == '__main__': | |
# Taking input of n | |
n = int(input()) | |
# Taking input all numbers as a string separated by spaces and splitting with spaces. | |
# canverting them individually into integers using map | |
arr = map(int, input().split()) | |
# Removing duplicate | |
arr = set(arr) | |
# Getting max score | |
maxi = max(arr) | |
# Remving the max score | |
arr.remove(maxi) | |
# printing the runner-up score | |
print(max(arr)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment