초보몽키의 개발공부로그 hackerrank - Nested Lists
04 Nov 2017 | 알고리즘 프로그래밍문제
Given the names and grades for each student in a Physics class of students, store them in a nested list and print the name(s) of any student(s) having the second lowest grade. Note: If there are multiple students with the same grade, order their names alphabetically and print each name on a new line. Input Format The first line contains an integer, , the number of students. The subsequent lines describe each student over lines; the first line contains a student's name, and the second line contains their grade. Constraints There will always be one or more students having the second lowest grade. Output Format Print the name(s) of any student(s) having the second lowest grade in Physics; if there are multiple students, order their names alphabetically and print each one on a new line. Sample Input 5 Harry 37.21 Berry 37.21 Tina 37.2 Akriti 41 Harsh 39 Sample Output Berry Harry 풀이코드
- 두번째로 작은 점수를 찾는다
- 해당 점수를 가진 사람 이름을 출력한다
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]))) 배운점
- python3 sorting how to
- sorted() 함수는 key 인자를 받아서 정렬 기준을 재지정 가능하다.
>>>from operator import itemgetter, attrgetter >>> sorted(student_tuples, key=itemgetter(2)) [('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)] >>> sorted(student_objects, key=attrgetter('age')) [('dave', 'B', 10), ('jane', 'B', 12), ('john', 'A', 15)]