Athlete Sort in Python | HackerRank Programming Solutions | HackerRank Python Solutions

Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank of Programming Language Python. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for Athlete Sort in Python-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

Introduction To Python

Python is a widely-used, interpreted, object-oriented, and high-level programming language with dynamic semantics, used for general-purpose programming. It was created by Guido van Rossum, and first released on February 20, 1991.

Python is a computer programming language often used to build websites and software, automate tasks, and conduct data analysis. It is also used to create various machine learning algorithm, and helps in Artificial Intelligence. Python is a general purpose language, meaning it can be used to create a variety of different programs and isn’t specialized for any specific problems. This versatility, along with its beginner-friendliness, has made it one of the most-used programming languages today. A survey conducted by industry analyst firm RedMonk found that it was the most popular programming language among developers in 2020.

Link for the Problem – Athlete Sort in python – HackerRank Solution

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.

---

Input Format :

The first line contains N and M separated by a space.
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.

Athlete Sort in python – HackerRank Solution

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=' ')