Sort the Students by Their Kth Score — LeetCode 2545 Python Solution

The problem

There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam.

Example

Input

score = [[10,6,9,1],[7,5,11,2],[4,8,3,15]], k = 2

Output

[[7,5,11,2],[10,6,9,1],[4,8,3,15]]

Explanation

In the above diagram, S denotes the student, while E denotes the exam.

Python solution

class Solution:
    def sortTheStudents(self, score: List[List[int]], k: int) -> List[List[int]]:
        return sorted(score, key=lambda x: -x[k])

Complexity

Pattern: Matrix and Grid

Treat a 2-D grid as a graph whose neighbours are the four adjacent cells. LeetCode 2545. Sort the Students by Their Kth Score is filed here because LeetCode tags it Matrix, which is the vocabulary this hub collects.

The matrix and grid guide has the Python template for the pattern and the 216 LeetCode problems that use it.

Related problems