-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatrix median
54 lines (42 loc) · 1.29 KB
/
matrix median
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
int n = matrix.size(), m = matrix[0].size();
int min = INT_MAX, max = 0;
for(int i=0; i<n; i++)
{
for(int j=0; j<m; j++)
{
if(matrix[i][j]<min)
min = matrix[i][j];
if(matrix[i][j] > max)
max = matrix[i][j];
}
}
int small_values = (m*n)/2;
int s = min , e = max, small = 0;
while(s<=e)
{
int mid = s + (e - s)/2;
small = 0;
for(int i=0; i<n; i++)
{
int col = m-1;
int row = 0;
while(row<=col)
{
int mid2 = row + (col-row)/2;
if(matrix[i][mid2]<=mid)
{
row = mid2 + 1;
}
else
{
col = mid2 - 1;
}
}
small+=row;
}
if(small <= small_values)
s = mid + 1;
else
e = mid - 1;
}
return s;