From 3ab16f80f8d5e6509ed0045a2b5d49a8728c9f77 Mon Sep 17 00:00:00 2001
From: Abinash Karmakar <codeAbinash@gmail.com>
Date: Sun, 7 Jan 2024 23:49:27 +0530
Subject: [PATCH] Added some code

---
 ...ible-and-non-divisible-sums-difference.cpp | 17 ++++++++++++++
 ...th-smallest-element-in-a-sorted-matrix.cpp | 22 +++++++++++++++++++
 2 files changed, 39 insertions(+)
 create mode 100644 leetcode/problems/cpp/divisible-and-non-divisible-sums-difference.cpp
 create mode 100644 leetcode/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp

diff --git a/leetcode/problems/cpp/divisible-and-non-divisible-sums-difference.cpp b/leetcode/problems/cpp/divisible-and-non-divisible-sums-difference.cpp
new file mode 100644
index 0000000..761c773
--- /dev/null
+++ b/leetcode/problems/cpp/divisible-and-non-divisible-sums-difference.cpp
@@ -0,0 +1,17 @@
+// by @codeAbinash
+// Time : O(n)
+// Space : O(1)
+
+class Solution {
+ public:
+   int differenceOfSums(int n, int m) {
+      int sum1 = 0, sum2 = 0;
+      for (int i = 1; i <= n; i++) {
+         if (i % m == 0)
+            sum1 += i;
+         else
+            sum2 += i;
+      }
+      return sum2 - sum1;
+   }
+};
diff --git a/leetcode/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp b/leetcode/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp
new file mode 100644
index 0000000..36d81ab
--- /dev/null
+++ b/leetcode/problems/cpp/kth-smallest-element-in-a-sorted-matrix.cpp
@@ -0,0 +1,22 @@
+// by @codeAbinash
+// Time : O(nlogk)
+// Space : O(k)
+
+#include "queue"
+#include "vector"
+
+using namespace std;
+
+class Solution {
+ public:
+   int kthSmallest(vector<vector<int>>& matrix, int k) {
+      priority_queue<int> pq;
+      for (auto row : matrix) {
+         for (auto num : row) {
+            pq.push(num);
+            if (pq.size() > k) pq.pop();
+         }
+      }
+      return pq.top();
+   }
+};