<jupyter_start><jupyter_text>input5Harry37.21Berry37.21Tina37.2Akriti41Harsh39  outputBerryHarry  output formatsPrint 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. - 문제 이해 :- 그룹 중 두 번째로 낮은 학생의 이름을 호출, 만약 두 번째로 낮은 학생이 동점으로 두 명이면알파벳순으로 정렬할 것.<jupyter_code>students = [['Harry', 37.21], ['Berry', 37.21], ['Tina', 37.2], ['Akriti', 41], ['Harsh', 39]]
# marksheet = []
# for _ in range(0, int(input())) : 
#     marksheet.append([input(), float(input())])
    
second_higest = sorted(list(set([marks for name, marks in students])))[1]
# print(second_higest)
print('\n'.join([a for a,b in sorted(students) if b == second_higest]))<jupyter_output>Berry
Harry
{'fraction_non_alphanumeric': 0.14634146341463414, 'fraction_numerical': 0.04236200256739409, 'mean_word_length': 5.24, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '368339', 'license': 'MIT', 'n_tokens_mistral': 356, 'n_tokens_neox': 351, 'n_words': 87, 'path': 'Hacker_rank/Easy/180210_Nested Lists.ipynb', 'repo_name': 'KANG91/TIL', 'size': '779'}