-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMedian_in_a_row_wise_sorted_matrix.cpp
89 lines (80 loc) · 1.96 KB
/
Median_in_a_row_wise_sorted_matrix.cpp
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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
//{ Driver Code Starts
//Initial template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
int blackbox(vector<vector<int>> &matrix, int x, int n, int m)
{
int cnt = 0;
for(int i = 0; i < n; i++)
{
cnt += upper_bound(matrix[i], x, m);
}
return cnt;
}
int upper_bound(vector<int>arr, int x, int m)
{
int low = 0;
int high = m - 1;
int ans = m;
while(low <= high)
{
int mid = (low + high)/2;
if(arr[mid] > x)
{
ans = mid;
high = mid - 1;
}
else low = mid + 1;
}
return ans;
}
int median(vector<vector<int>> &matrix, int R, int C){
int low = INT_MAX;
int high = INT_MIN;
int req = (R*C) / 2;
for(int i = 0; i < matrix.size(); i++)
{
if(low > matrix[i][0]) low = matrix[i][0];
if(high < matrix[i][C-1]) high = matrix[i][C-1];
}
while(low <= high)
{
int mid = (low + high)/ 2;
int SmallerEquals = blackbox(matrix,mid, R, C);
if(SmallerEquals <= req)
{
low = mid +1;
}
else
{
high = mid -1;
}
}
return low;
}
};
//{ Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int r, c;
cin>>r>>c;
vector<vector<int>> matrix(r, vector<int>(c));
for(int i = 0; i < r; ++i)
for(int j = 0;j < c; ++j)
cin>>matrix[i][j];
Solution obj;
int ans=-1;
ans=obj.median(matrix, r, c);
cout<<ans<<"\n";
}
return 0;
}
// } Driver Code Ends