[Hackerrank] Nested Lists

문제 설명

Given the names and grades for each student in a class of N students, store them in a nested list and print the name(s) of any student(s) having the second lowest grade.

제한사항

The first line contains an integer, N, the number of students. The 2N subsequent lines describe each student over 2 lines.

• The first line contains a student’s name.
• The second line contains their grade.
• 2 $\leq$ N $\leq$ 5
• There will always be one or more students having the second lowest grade.
• If there are multiple students with the second lowest grade, order their names alphabetically and print each name on a new line

입출력 예

Sample Input 0

5
Harry
37.21
Berry
37.21
Tina
37.2
Akriti
41
Harsh
39

Sample Output 0

Berry
Harry

Idea

알고리즘도 필요없고, 구현만 하면 되는 문제이다.
아래와 같이 풀어보았다 ㅎ

Code

class Record:
    def __init__(self,name, score):
        self.name = name
        self.score = score
    def __repr__(self):
        return repr((self.name, self.score))
    def value_return(self):
        return self.score
    def name_return(self):
        return self.name


if __name__ == '__main__':
    n = int(input())
    record_list = list()
    for i in range(n):
        name = input()
        score = float(input())
        record_list.append(Record(name, score))
    
    record_list = list(sorted(record_list, key=lambda x:x.score))
    score_list = list()
    
    for i in range(n):
        score_list.append(record_list[i].value_return())

    second_score = sorted(set(score_list))[1]
    name_list = list()
    for i in range(n):
        if second_score == record_list[i].value_return():
            name_list.append(record_list[i].name_return())
    name_list.sort()
    for name in name_list:
        print(name)

Explain

파이썬스럽게 못 풀었다…아쉽다.
리스트에 name과 score를 입력해주고, score를 기준으로 2번째값을 구해낸 다음, 2번째 값을 가지고있는 name들을 리스트에 넣어주고, 리스트를 알파벳순으로 정렬해서 출력한다!
나도 밑에 풀이처럼 list comprehension을 적용했다면, 파이썬스럽게 코딩할수있었는데 아쉽다 ㅎ…

다른사람의 풀이 #1

---

score_list = []
for _ in range(int(input())):
    name = input()
    score = float(input())
    score_list.append([name, score])
second_highest = sorted(set([score for name, score in score_list]))[1]
print('\n'.join(sorted([name for name, score in score_list if score == second_highest])))

---

References

• https://docs.python.org/3/howto/sorting.html
• https://www.programiz.com/python-programming/methods/list/sort