Problem Statement

Kth Lowest scorer Problem Description You're handed a 2D matrix of exam marks earned by students spread across several schools in a state — each row belongs to one school, and each entry in that row is one student's marks. Both across each row and down each column, the marks come sorted in non-decreasing order. Working for an analytics firm, you need to help evaluate exam performance across the whole state. Write a program that finds the K-th lowest scorer across the entire state. Note: 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 Every row and column of the matrix is guaranteed to already be sorted in non-decreasing or