blob: aad945815567cdfa590d05409d5b79e6f6e1dd2e (
plain)
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
|
#include "leetcode.h"
class Solution {
public:
int kthSmallest(vector<vector<int>> &matrix, int k) {
int n = matrix.size(), left = matrix[0][0], right = matrix[n - 1][n - 1],
mid = 0;
while (left < right) {
mid = left + (right - left) / 2;
int num = 0;
for (int i = 0; i < n; i++) {
int pos = upper_bound(matrix[i].begin(), matrix[i].end(), mid) -
matrix[i].begin();
num += pos;
}
if (num < k)
left = mid + 1;
else
right = mid;
}
return left;
}
};
int main() {
Solution obj;
vector<vector<int>> matrix;
int k;
obj.kthSmallest(matrix, k);
}
|