Athlete Sort HackerRank Solution In Python

Problem

You are given a spreadsheet that contains a list of N athletes and their details (such as age, height, weight and so on). You are required to sort the data based on the K^th attribute and print the final resulting table. Follow the example given below for better understanding.

Note that K is indexed from 0 to M – 1, where M is the number of attributes.

Note: If two attributes are the same for different rows, for example, if two atheletes are of the same age, print the row that appeared first in the input.

Input Format

The first line contains N and M separated by a space.
The next N lines each contain M elements.
The last line contains K.

Constraints

1 ≤ N,M ≤ 1000

0 ≤ K ≤ M

Each element ≤ 1000

Output Format

Print the N lines of the sorted table. Each line should contain the space separated elements. Check the sample below for clarity.

Sample Input 0

5 310 2 57 1 09 9 91 23 126 5 91

Sample Output 0

7 1 010 2 56 5 99 9 91 23 12

Explanation 0

The details are sorted based on the second attribute, since K is zero-indexed.

Solution to HackerRank Athelete Sort In Python

N, M = list(map(int, input().split()))ath = [list(map(int, input().split())) for _ in range(N)]K = int(input())ath.sort(key=lambda x: x[K])    for n in ath:    print(*n)