aboutsummaryrefslogtreecommitdiff
path: root/other/kth_smallest_sorted_matrix.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/kth_smallest_sorted_matrix.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/kth_smallest_sorted_matrix.cpp')
-rw-r--r--other/kth_smallest_sorted_matrix.cpp30
1 files changed, 30 insertions, 0 deletions
diff --git a/other/kth_smallest_sorted_matrix.cpp b/other/kth_smallest_sorted_matrix.cpp
new file mode 100644
index 0000000..aad9458
--- /dev/null
+++ b/other/kth_smallest_sorted_matrix.cpp
@@ -0,0 +1,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);
+}