Problem Statement

Kth Lowest scorer Problem Description You are given a 2D matrix representing the marks scored by students across multiple schools in a state. Each row corresponds to a school, and each element in a row is the marks of a student from that school. Marks in each row as well as column are sorted in non-decreasing order. You work for an analytics agency that wants to evaluate how students have done in their exams. Your task is to write a program to find the K-th lowest scorer in the entire state. Note: that some students may have negative marks. Input Format The first line contains an integer representing the number of rows, marks_rows . The second line contains an integer representing the number of columns, marks_column . Each of the next marks_rows lines contains exactly marks_column space-separated marks. The last line contains the value k . Output Format An integer representing the k th lowest scorer. Constraints All the rows and columns of the matrix are guaranteed to be sorted in non-