Athlete Sort in python - HackerRank Solution
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 Kth 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.
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 next N lines each contain M elements.
The last line K contains.
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 :
5 3 10 2 5 7 1 0 9 9 9 1 23 12 6 5 9 1
Sample Output :
7 1 0 10 2 5 6 5 9 9 9 9 1 23 12
Explanation :
The details are sorted based on the second attribute, since K is zero-indexed.
Solution :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 | # Athlete Sort in python - Hacker Rank Solution # Python 3 #!/bin/python3 import math import os import random import re import sys if __name__ == '__main__': nm = input().split() n = int(nm[0]) m = int(nm[1]) arr = [] for _ in range(n): arr.append(list(map(int, input().rstrip().split()))) k = int(input()) # Athlete Sort in python - Hacker Rank Solution START arr.sort(key = lambda x : x[k]) for i in arr: print(*i,sep=' ') # Athlete Sort in python - Hacker Rank Solution END |
Disclaimer :-
the above hole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.